| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A new decidable Horn fragment of predicate calculus
|
Orevkov, V. P.
|
|
|
134 |
5 |
p. 2403-2410
|
article
|
| 2 |
A new decidable Horn fragment of predicate calculus
|
Orevkov, V. P.
|
|
2006
|
134 |
5 |
p. 2403-2410
|
article
|
| 3 |
Automated proofs of upper bounds on the running time of splitting algorithms
|
Fedin, S. S.
|
|
|
134 |
5 |
p. 2383-2391
|
article
|
| 4 |
Automated proofs of upper bounds on the running time of splitting algorithms
|
Fedin, S. S.
|
|
2006
|
134 |
5 |
p. 2383-2391
|
article
|
| 5 |
Circuit lower bounds and linear codes
|
Paturi, R.
|
|
|
134 |
5 |
p. 2425-2434
|
article
|
| 6 |
Circuit lower bounds and linear codes
|
Paturi, R.
|
|
2006
|
134 |
5 |
p. 2425-2434
|
article
|
| 7 |
Complexity bound for the absolute factorization of parametric polynomials
|
Ayad, A.
|
|
|
134 |
5 |
p. 2325-2339
|
article
|
| 8 |
Complexity bound for the absolute factorization of parametric polynomials
|
Ayad, A.
|
|
2006
|
134 |
5 |
p. 2325-2339
|
article
|
| 9 |
Computing the dimension of a semi-algebraic set
|
Basu, S.
|
|
|
134 |
5 |
p. 2346-2353
|
article
|
| 10 |
Computing the dimension of a semi-algebraic set
|
Basu, S.
|
|
2006
|
134 |
5 |
p. 2346-2353
|
article
|
| 11 |
Intuitionistic Frege systems are polynomially equivalent
|
Mints, G.
|
|
|
134 |
5 |
p. 2392-2402
|
article
|
| 12 |
Intuitionistic Frege systems are polynomially equivalent
|
Mints, G.
|
|
2006
|
134 |
5 |
p. 2392-2402
|
article
|
| 13 |
On infinite real trace rational languages of maximum topological complexity
|
Finkel, O.
|
|
|
134 |
5 |
p. 2435-2444
|
article
|
| 14 |
On infinite real trace rational languages of maximum topological complexity
|
Finkel, O.
|
|
2006
|
134 |
5 |
p. 2435-2444
|
article
|
| 15 |
On some properties of min-wise independent families and groups of permutations
|
Bargachev, V.
|
|
|
134 |
5 |
p. 2340-2345
|
article
|
| 16 |
On some properties of min-wise independent families and groups of permutations
|
Bargachev, V.
|
|
2006
|
134 |
5 |
p. 2340-2345
|
article
|
| 17 |
On theoretical and practical acceleration of randomized computation of the determinant of an integer matrix
|
Pan, V. Y.
|
|
|
134 |
5 |
p. 2411-2424
|
article
|
| 18 |
On theoretical and practical acceleration of randomized computation of the determinant of an integer matrix
|
Pan, V. Y.
|
|
2006
|
134 |
5 |
p. 2411-2424
|
article
|
| 19 |
On the vertex connectivity of a relation in an association scheme
|
Evdokimov, S. A.
|
|
|
134 |
5 |
p. 2354-2357
|
article
|
| 20 |
On the vertex connectivity of a relation in an association scheme
|
Evdokimov, S. A.
|
|
2006
|
134 |
5 |
p. 2354-2357
|
article
|
| 21 |
Towards applying computational complexity to foundations of physics
|
Kreinovich, V.
|
|
|
134 |
5 |
p. 2358-2382
|
article
|
| 22 |
Towards applying computational complexity to foundations of physics
|
Kreinovich, V.
|
|
2006
|
134 |
5 |
p. 2358-2382
|
article
|
Journal description