| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
Branching Time Logics $\mathcal {BTL}^{\mathrm {U,S}}_{\mathrm {N},\mathrm {N}^{-1}}(\mathcal {Z})_{\alpha }$ with Operations Until and Since Based on Bundles of Integer Numbers, Logical Consecutions, Deciding Algorithms
|
Rybakov, V.
|
|
2007
|
43 |
2 |
p. 254-271
|
artikel
|
| 2 |
Enumerate and Expand: Improved Algorithms for Connected Vertex Cover and Tree Cover
|
Mölle, Daniel
|
|
2007
|
43 |
2 |
p. 234-253
|
artikel
|
| 3 |
Feasible Operations on Proofs: The Logic of Proofs for Bounded Arithmetic
|
Goris, Evan
|
|
2007
|
43 |
2 |
p. 185-203
|
artikel
|
| 4 |
Foreword
|
Artemov, Sergei
|
|
2007
|
43 |
2 |
p. 99
|
artikel
|
| 5 |
Incremental Branching Programs
|
Gál, Anna
|
|
2007
|
43 |
2 |
p. 159-184
|
artikel
|
| 6 |
Interacting Explicit Evidence Systems
|
Yavorskaya (Sidon), Tatiana
|
|
2007
|
43 |
2 |
p. 272-293
|
artikel
|
| 7 |
On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction
|
Khachiyan, Leonid
|
|
2007
|
43 |
2 |
p. 204-233
|
artikel
|
| 8 |
SZK Proofs for Black-Box Group Problems
|
Arvind, V.
|
|
2007
|
43 |
2 |
p. 100-117
|
artikel
|
| 9 |
The Complexity of Equality Constraint Languages
|
Bodirsky, Manuel
|
|
2007
|
43 |
2 |
p. 136-158
|
artikel
|
| 10 |
Tuples of Disjoint $\mathsf{NP}$-Sets
|
Beyersdorff, Olaf
|
|
2007
|
43 |
2 |
p. 118-135
|
artikel
|
Tijdschrift beschrijving