< previous issue
next issue >
Polynomial algorithm for finding the largest independent sets in graphs without forks
Local transformations of graphs preserving independence number
Alekseev V.E.; Lozin V.V.
Height of minor faces in plane normal maps
Borodin O.V.; Loparev D.V.
Average time of computing Boolean operators
Local complexity of Boolean functions
Computation of Boolean functions by randomized programs
Residual reliability of P-threshold graphs
Searching expenditure and interval graphs
On finding a cyclic tour and a vehicle loading plan yielding maximum profit
Gimadi E.K.; Glebov N.I.; Serdyukov A.I.
On the search of optimal order of variables in the synthesis of switching circuits by cascade technique
Grinchuk M.I.; Kochergin V.V.
Criterion of generativeness of sets of rational probabilities by a class of Boolean functions
On the structure of connected locally GQ(3,9)-graphs
Makhnev A.A.; Paduchikh D.V.
On a lower bound on the number of perfect binary codes
On enumeration of the perfect binary codes of length 15
A-classification of idempotent functions of many-valued logic
Comparing the sizes of nondeterministic branching read-k-times programs
Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases
On cyclic <m,n>-enumerations
Redundancy estimates for the Lempel-Ziv algorithm of data compression
On nonsystematic perfect binary codes of length 15
Finitely generated distribution algebras
A greedy algorithm for maximizing a linear objective function
On complexity of minimization and compression problems for models of sequential choice
Local spectra of perfect binary codes
Author index to volume
Here are a few pages on the site that we think you may find useful: