| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A novel giant-subgraph phase-transition in sparse random k-partite graphs
|
Voll, Ulrich
|
|
2005
|
153 |
1-3 |
p. 153-181
29 p.
|
article
|
| 2 |
A sharp threshold for the renameable-Horn and the q-Horn properties
|
Creignou, Nadia
|
|
2005
|
153 |
1-3 |
p. 48-57
10 p.
|
article
|
| 3 |
Author index to volume 153
|
|
|
2005
|
153 |
1-3 |
p. 182-
1 p.
|
article
|
| 4 |
Contents
|
|
|
2005
|
153 |
1-3 |
p. viii-ix
nvt p.
|
article
|
| 5 |
Editorial Board
|
|
|
2005
|
153 |
1-3 |
p. v-vii
nvt p.
|
article
|
| 6 |
Guest editors
|
|
|
2005
|
153 |
1-3 |
p. 2-
1 p.
|
article
|
| 7 |
Guide for authors
|
|
|
2005
|
153 |
1-3 |
p. I-V
nvt p.
|
article
|
| 8 |
On the complexity of unfrozen problems
|
Beacham, Adam
|
|
2005
|
153 |
1-3 |
p. 3-24
22 p.
|
article
|
| 9 |
On the typical case complexity of graph optimization
|
Faragó, András
|
|
2005
|
153 |
1-3 |
p. 73-88
16 p.
|
article
|
| 10 |
Resolution complexity of random constraint satisfaction problems: Another half of the story
|
Gao, Yong
|
|
2005
|
153 |
1-3 |
p. 124-140
17 p.
|
article
|
| 11 |
SAT distributions with planted assignments and phase transitions between decision and optimization problems
|
Dimitriou, Tassos
|
|
2005
|
153 |
1-3 |
p. 58-72
15 p.
|
article
|
| 12 |
Special Issue on Typical Case Complexity and Phase Transitions
|
Kirousis, L.M.
|
|
2005
|
153 |
1-3 |
p. 1-
1 p.
|
article
|
| 13 |
The resolution complexity of random graph k-colorability
|
Beame, Paul
|
|
2005
|
153 |
1-3 |
p. 25-47
23 p.
|
article
|
| 14 |
Threshold properties of random boolean constraint satisfaction problems
|
Istrate, Gabriel
|
|
2005
|
153 |
1-3 |
p. 141-152
12 p.
|
article
|
| 15 |
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon
|
Franco, John
|
|
2005
|
153 |
1-3 |
p. 89-123
35 p.
|
article
|
Journal description