| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Borel reducibility as an additive property of domains
|
Kanovei, V. G.
|
|
2009
|
158 |
5 |
p. 708-712
|
article
|
| 2 |
Complexity of the identity checking problem for finite semigroups
|
Almeida, J.
|
|
2009
|
158 |
5 |
p. 605-614
|
article
|
| 3 |
Defining the integers in large rings of a number field using one universal quantifier
|
Cornelissen, G.
|
|
2009
|
158 |
5 |
p. 713-726
|
article
|
| 4 |
Faster subsequence recognition in compressed strings
|
Tiskin, A.
|
|
2009
|
158 |
5 |
p. 759-769
|
article
|
| 5 |
Fuzzy constructive logic
|
Zaslavsky, I. D.
|
|
2009
|
158 |
5 |
p. 677-688
|
article
|
| 6 |
In some curved spaces, one can solve NP-hard problems in polynomial time
|
Kreinovich, V.
|
|
2009
|
158 |
5 |
p. 727-740
|
article
|
| 7 |
Logical equations in monadic logic
|
Mints, G.
|
|
2009
|
158 |
5 |
p. 741-752
|
article
|
| 8 |
Nonmaximal decidable structures
|
Bès, A.
|
|
2009
|
158 |
5 |
p. 615-622
|
article
|
| 9 |
On a class of bases for boolean functions
|
Skordev, D.
|
|
2009
|
158 |
5 |
p. 753-758
|
article
|
| 10 |
On equations in free semigroups with certain constraints on their solutions
|
Durnev, V. G.
|
|
2009
|
158 |
5 |
p. 671-676
|
article
|
| 11 |
Proof compressions with circuit-structured substitutions
|
Gordeev, L.
|
|
2009
|
158 |
5 |
p. 645-658
|
article
|
| 12 |
The decision problem for some logics for finite words on infinite alphabets
|
Choffrut, Ch.
|
|
2009
|
158 |
5 |
p. 659-670
|
article
|
| 13 |
The lengths of proofs: Kreisel’s conjecture and Gödel’s speed-up theorem
|
Cavagnetto, S.
|
|
2009
|
158 |
5 |
p. 689-707
|
article
|
| 14 |
Time hierarchies for cryptographic function inversion with advice
|
Grigoriev, D. Yu.
|
|
2009
|
158 |
5 |
p. 633-644
|
article
|
| 15 |
Tree inclusions in windows and slices
|
Guessarian, I.
|
|
2009
|
158 |
5 |
p. 623-632
|
article
|
Journal description