Volume 104, Numbers 1-2, 2010
Volume 104, Number 3, 2010
- Juraj Hromkovic, Borislav Suster, Eduard Toman:
Preface.

- Farid M. Ablayev, Svetlana Ablayeva:
A Communication Approach to the Superposition Problem.
185-200

- Andreas Alexander Albrecht, Alexander V. Chaskin, Costas S. Iliopoulos, Oktay M. Kasim-Zade, Georgios Lappas, Kathleen Steinhöfel:
A Note on a priori Estimations of Classification Circuit Complexity.
201-217

- Marina An. Alekhina:
Synthesis and Complexity of Asymptotically Optimal Circuits with Unreliable Gates.
219-225

- Sergej B. Gashkov, Igor Gashkov:
Some Remarks on Testing Irreducibility of Polynomials and Normality of Bases in Finite Fields.
227-238

- Sergei A. Lozhkin, Alexander E. Shiganov:
High Accuracy Asymptotic Bounds on the BDD Size and Weight of the Hardest Functions.
239-253

- Boris Melnikov:
Extended Nondeterministic Finite Automata.
255-265

- Boris Melnikov:
Once More on the Edge-Minimization of Nondeterministic Finite Automata and the Connected Problems.
267-283

- Mikhail Ju. Moshkov:
Greedy Algorithm with Weights for Decision Tree Construction.
285-292

Volume 104, Number 4, 2010
Last update Wed May 22 17:36:31 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page