Titlebook: Mathematical Foundations of Computer Science 2001; 26th International S Jiří Sgall,Aleš Pultr,Petr Kolman Conference proceedings 2001 Sprin

Functional

New Algorithms for ,-SAT Based on the Local Search Principle principle of local search. Their deterministic and their probabilistic versions and variations, have been shown to achieve the best complexity bounds that are known for .-SAT (or the special case 3-SAT). We review these algorithms, their underlying principles and their analyses.

储备

Exact Results for Accepting Probabilities of Quantum Automataified arbitrarily. In this paper, we determine the maximum probabilities achieved by QFAs for several languages. In particular, we show that any language that is not recognized by an RFA (reversible finite automaton) can be recognized by a QFA with probability at most 0.7726....

Hemodialysis

Graph-Driven Free Parity BDDs: Algorithms and Lower Boundsain result of this paper is a polynomial time algorithm that minimizes the number of nodes in a graph-driven free parity BDD. The second main result is an exponential lower bound on the size of graph-driven free parity BDD for linear code functions.

就职

https://doi.org/10.1007/3-540-44683-4algorithms; complexity; complexity theory; computer; computer science; logic; mathematical logic; programmi

APRON

LAPSE

Amendment

0302-9743 Overview: Includes supplementary material: 978-3-540-42496-3978-3-540-44683-5Series ISSN 0302-9743 Series E-ISSN 1611-3349

CROAK

Jiří Sgall,Aleš Pultr,Petr KolmanIncludes supplementary material:

冷淡周边

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/m/image/626135.jpg

杂役