| RUS ENG |
| Full version |
|
|
|
| JOURNALS // Zapiski Nauchnykh Seminarov POMI // Archive |
|
2001, Volume 277
|
| | | General information | | | Contents | | |
|
Combined hierarchies of finite random access machines A. P. Beltiukov |
5 | |
|
|
Algorithms for SAT and upper bounds on their complexity M. A. Vsemirnov, E. A. Hirsch, E. Ya. Dantsin, S. V. Ivanov |
14 | |
|
|
Double-exponential growth of the number of vectors of solutions of polynomial systems D. Yu. Grigor'ev |
47 | |
|
|
Upper bounds on the height of terms in the solution of the semiunification problem V. B. Zhizhkun |
53 | |
|
|
Upper bound on the height of terms in proofs with bound-depth-restricted cuts B. Yu. Konev |
80 | |
|
|
A polynomial lower bound for the size of any S. A. Norin |
104 | |