|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
13 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | A combinatorial characterization of resolution width |
Atserias, Albert |
2008 |
74 | 3 |
p. 323-334 12 p. |
artikel |
|
| 2 | Contents |
2008 |
74 | 3 |
p. OBC- 1 p. |
artikel |
||
| 3 | Editorial Board |
2008 |
74 | 3 |
p. IFC- 1 p. |
artikel |
||
| 4 | Erratum to “Propagating XML constraints to relations” [J. Comput. System Sci. 73 (2007) 316–361] |
Davidson, Susan |
2008 |
74 | 3 |
p. 404-405 2 p. |
artikel |
|
| 5 | Extremal properties of polynomial threshold functions |
O'Donnell, Ryan |
2008 |
74 | 3 |
p. 298-312 15 p. |
artikel |
|
| 6 | Lower bounds for predecessor searching in the cell probe model |
Sen, Pranab |
2008 |
74 | 3 |
p. 364-385 22 p. |
artikel |
|
| 7 | Minimization of decision trees is hard to approximate |
Sieling, Detlef |
2008 |
74 | 3 |
p. 394-403 10 p. |
artikel |
|
| 8 | [No title] |
Buhrman, Harry |
2008 |
74 | 3 |
p. 297- 1 p. |
artikel |
|
| 9 | Proving SAT does not have small circuits with an application to the two queries problem |
Fortnow, Lance |
2008 |
74 | 3 |
p. 358-363 6 p. |
artikel |
|
| 10 | Quantum certificate complexity |
Aaronson, Scott |
2008 |
74 | 3 |
p. 313-322 10 p. |
artikel |
|
| 11 | The complexity of stochastic sequences |
Merkle, Wolfgang |
2008 |
74 | 3 |
p. 350-357 8 p. |
artikel |
|
| 12 | The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs |
Calabro, Chris |
2008 |
74 | 3 |
p. 386-393 8 p. |
artikel |
|
| 13 | Vertex cover might be hard to approximate to within 2 − ε |
Khot, Subhash |
2008 |
74 | 3 |
p. 335-349 15 p. |
artikel |
13 gevonden resultaten