nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A-classification of idempotent functions of many-valued logic
|
Marchenkov, S.S. |
|
2004 |
135 |
1-3 |
p. 183-203 21 p. |
artikel |
2 |
A greedy algorithm for maximizing a linear objective function
|
Shenmaier, V.V. |
|
2004 |
135 |
1-3 |
p. 267-279 13 p. |
artikel |
3 |
Author index to volume
|
|
|
2004 |
135 |
1-3 |
p. 309- 1 p. |
artikel |
4 |
Average time of computing Boolean operators
|
Chashkin, A.V. |
|
2004 |
135 |
1-3 |
p. 41-54 14 p. |
artikel |
5 |
Comparing the sizes of nondeterministic branching read-k-times programs
|
Okol'nishnikova, E.A. |
|
2004 |
135 |
1-3 |
p. 205-222 18 p. |
artikel |
6 |
Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases
|
Orlov, V.A. |
|
2004 |
135 |
1-3 |
p. 223-233 11 p. |
artikel |
7 |
Computation of Boolean functions by randomized programs
|
Chashkin, A.V. |
|
2004 |
135 |
1-3 |
p. 65-82 18 p. |
artikel |
8 |
Contents
|
|
|
2004 |
135 |
1-3 |
p. ix-x nvt p. |
artikel |
9 |
Criterion of generativeness of sets of rational probabilities by a class of Boolean functions
|
Kolpakov, R.M. |
|
2004 |
135 |
1-3 |
p. 125-142 18 p. |
artikel |
10 |
Editorial Board
|
|
|
2004 |
135 |
1-3 |
p. v-vii nvt p. |
artikel |
11 |
Finitely generated distribution algebras
|
Salimov, F.I. |
|
2004 |
135 |
1-3 |
p. 259-265 7 p. |
artikel |
12 |
Guide for authors
|
|
|
2004 |
135 |
1-3 |
p. 310-313 4 p. |
artikel |
13 |
Height of minor faces in plane normal maps
|
Borodin, O.V. |
|
2004 |
135 |
1-3 |
p. 31-39 9 p. |
artikel |
14 |
Local complexity of Boolean functions
|
Chashkin, A.V. |
|
2004 |
135 |
1-3 |
p. 55-64 10 p. |
artikel |
15 |
Local spectra of perfect binary codes
|
Vasil'eva, A.Yu. |
|
2004 |
135 |
1-3 |
p. 301-307 7 p. |
artikel |
16 |
Local transformations of graphs preserving independence number
|
Alekseev, V.E. |
|
2004 |
135 |
1-3 |
p. 17-30 14 p. |
artikel |
17 |
On a lower bound on the number of perfect binary codes
|
Malyugin, S.A. |
|
2004 |
135 |
1-3 |
p. 157-160 4 p. |
artikel |
18 |
On complexity of minimization and compression problems for models of sequential choice
|
Sholomov, L.A. |
|
2004 |
135 |
1-3 |
p. 281-300 20 p. |
artikel |
19 |
On cyclic 〈m,n〉-enumerations
|
Perezhogin, A.L |
|
2004 |
135 |
1-3 |
p. 235-243 9 p. |
artikel |
20 |
On enumeration of the perfect binary codes of length 15
|
Malyugin, S.A. |
|
2004 |
135 |
1-3 |
p. 161-181 21 p. |
artikel |
21 |
On finding a cyclic tour and a vehicle loading plan yielding maximum profit
|
Gimadi, E.Kh. |
|
2004 |
135 |
1-3 |
p. 105-111 7 p. |
artikel |
22 |
On nonsystematic perfect binary codes of length 15
|
Romanov, A.M. |
|
2004 |
135 |
1-3 |
p. 255-258 4 p. |
artikel |
23 |
On the search of optimal order of variables in the synthesis of switching circuits by cascade technique
|
Grinchuk, M.I. |
|
2004 |
135 |
1-3 |
p. 113-123 11 p. |
artikel |
24 |
On the structure of connected locally GQ(3,9)-graphs
|
Makhnev, A.A. |
|
2004 |
135 |
1-3 |
p. 143-156 14 p. |
artikel |
25 |
Polynomial algorithm for finding the largest independent sets in graphs without forks
|
Alekseev, V.E. |
|
2004 |
135 |
1-3 |
p. 3-16 14 p. |
artikel |
26 |
Preface
|
Borodin, Oleg |
|
2004 |
135 |
1-3 |
p. 1- 1 p. |
artikel |
27 |
Redundancy estimates for the Lempel–Ziv algorithm of data compression
|
Potapov, V.N. |
|
2004 |
135 |
1-3 |
p. 245-254 10 p. |
artikel |
28 |
Residual reliability of P-threshold graphs
|
Chernyak, A.A. |
|
2004 |
135 |
1-3 |
p. 83-95 13 p. |
artikel |
29 |
Searching expenditure and interval graphs
|
Fomin, Fedor V. |
|
2004 |
135 |
1-3 |
p. 97-104 8 p. |
artikel |