default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 135
Volume 135, Number 1-3, 15 January 2004
- Oleg V. Borodin:
Preface: Russian Translations II. 1- - Vladimir E. Alekseev
:
Polynomial algorithm for finding the largest independent sets in graphs without forks. 3-16 - Vladimir E. Alekseev, Vadim V. Lozin:
Local transformations of graphs preserving independence number. 17-30 - Oleg V. Borodin, D. V. Loparev:
Height of minor faces in plane normal maps. 31-39 - A. V. Chashkin:
Average time of computing Boolean operators. 41-54 - A. V. Chashkin:
Local complexity of Boolean functions. 55-64 - A. V. Chashkin:
Computation of Boolean functions by randomized programs. 65-82 - Arkady A. Chernyak:
Residual reliability of P-threshold graphs. 83-95 - Fedor V. Fomin:
Searching expenditure and interval graphs. 97-104 - Eduard Kh. Gimadi, N. I. Glebov, A. I. Serdyukov:
On finding a cyclic tour and a vehicle loading plan yielding maximum profit. 105-111 - M. I. Grinchuk, Vadim V. Kochergin:
On the search of optimal order of variables in the synthesis of switching circuits by cascade technique. 113-123 - Roman M. Kolpakov:
Criterion of generativeness of sets of rational probabilities by a class of Boolean functions. 125-142 - Alexander A. Makhnev, D. V. Paduchikh:
On the structure of connected locally GQ(3, 9)-graphs. 143-156 - S. A. Malyugin:
On a lower bound on the number of perfect binary codes. 157-160 - S. A. Malyugin:
On enumeration of the perfect binary codes of length 15. 161-181 - S. S. Marchenkov:
A-classification of idempotent functions of many-valued logic. 183-203 - Elizaveta A. Okol'nishnikova:
Comparing the sizes of nondeterministic branching read-k-times programs. 205-222 - V. A. Orlov:
Complexity of implementing functions of k-valued logic by circuits and formulas in functionally complete bases. 223-233 - A. L. Perezhogin:
On cyclic <m,n>-enumerations. 235-243 - Vladimir N. Potapov:
Redundancy estimates for the Lempel-Ziv algorithm of data compression. 245-254 - Alexander M. Romanov:
On nonsystematic perfect binary codes of length 15. 255-258 - F. I. Salimov:
Finitely generated distribution algebras. 259-265 - V. V. Shenmaier:
A greedy algorithm for maximizing a linear objective function. 267-279 - Lev A. Sholomov:
On complexity of minimization and compression problems for models of sequential choice. 281-300 - Anastasia Yu. Vasil'eva:
Local spectra of perfect binary codes. 301-307
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-21 19:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
