"Zapiski Nauchnyh Seminarov POMI"
This issue is entitled " Computational complexity theory. Part VI"
editor M.A. Vsemirnov
- Beltiukov A. P. Combined hierarchies of finite random access
- Dantsin E. Ya., Hirsch E. A., Ivanov S. V., Vsemirnov M. A.
Algorithms for SAT and upper bounds on their complexity
- Grigor'ev D. Yu. Double-exponential growth of the number of
vectors of solutions of polynomial systems
- Jijkoun V. B. Upper bounds on the height of terms in the
solution of the semiunification problem
- Konev B. Yu. Upper bound on the height of terms in proofs
with bound-depth-restricted cuts
- Norin S. A. A polynomial lower bound for the size of any
$k$-min-wise independent set of permutations
- Reviews .......117
Paging: 119 pp.
Back to the Petersburg Department of
Steklov Institute of Mathematics