nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A Fast Algorithm for the Path 2-Packing Problem
|
Babenko, Maxim A. |
|
2008 |
46 |
1 |
p. 59-79 |
artikel |
2 |
Conjunctive Grammars over a Unary Alphabet: Undecidability and Unbounded Growth
|
Jeż, Artur |
|
2008 |
46 |
1 |
p. 27-58 |
artikel |
3 |
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
|
Buhrman, Harry |
|
2008 |
46 |
1 |
p. 143-156 |
artikel |
4 |
Efficient Algorithms for Sparse Cyclotomic Integer Zero Testing
|
Cheng, Qi |
|
2008 |
46 |
1 |
p. 120-142 |
artikel |
5 |
Equivalence Problems for Circuits over Sets of Natural Numbers
|
Glaßer, Christian |
|
2008 |
46 |
1 |
p. 80-103 |
artikel |
6 |
Generic Complexity of Presburger Arithmetic
|
Rybalov, Alexander N. |
|
2008 |
46 |
1 |
p. 2-8 |
artikel |
7 |
Maximal Intersection Queries in Randomized Input Models
|
Hoffmann, Benjamin |
|
2008 |
46 |
1 |
p. 104-119 |
artikel |
8 |
On the Complexity of Matrix Rank and Rigidity
|
Mahajan, Meena |
|
2008 |
46 |
1 |
p. 9-26 |
artikel |
9 |
Preface
|
Artemov, Sergei |
|
2008 |
46 |
1 |
p. 1 |
artikel |