| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Authentication schemes from actions on graphs, groups, or rings
|
Grigoriev, Dima
|
|
2010
|
162 |
3 |
p. 194-200
7 p.
|
article
|
| 2 |
Classical descriptive set theory as a refinement of effective descriptive set theory
|
Moschovakis, Yiannis N.
|
|
2010
|
162 |
3 |
p. 243-255
13 p.
|
article
|
| 3 |
Computability of finite-dimensional linear subspaces and best approximation
|
Brattka, Vasco
|
|
2010
|
162 |
3 |
p. 182-193
12 p.
|
article
|
| 4 |
Contents
|
|
|
2010
|
162 |
3 |
p. iv-
1 p.
|
article
|
| 5 |
Cut-free formulations for a quantified logic of here and there
|
Mints, Grigori
|
|
2010
|
162 |
3 |
p. 237-242
6 p.
|
article
|
| 6 |
Preface
|
Artemov, Sergei
|
|
2010
|
162 |
3 |
p. 173-174
2 p.
|
article
|
| 7 |
Referee’s report on Leonid Levin’s dissertation “Some Theorems on the Algorithmic Approach to Probability Theory and Information Theory” (November 27, 1972)
|
Shanin, N.A.
|
|
2010
|
162 |
3 |
p. 236-
1 p.
|
article
|
| 8 |
Some theorems on the algorithmic approach to probability theory and information theory
|
Levin, Leonid A.
|
|
2010
|
162 |
3 |
p. 224-235
12 p.
|
article
|
| 9 |
Structural complexity of AvgBPP
|
Itsykson, Dmitry
|
|
2010
|
162 |
3 |
p. 213-223
11 p.
|
article
|
| 10 |
The eskolemization of universal quantifiers
|
Iemhoff, Rosalie
|
|
2010
|
162 |
3 |
p. 201-212
12 p.
|
article
|
| 11 |
Unprovability threshold for the planar graph minor theorem
|
Bovykin, Andrey
|
|
2010
|
162 |
3 |
p. 175-181
7 p.
|
article
|
Journal description