|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 15 publication records. Showing 15 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf (eds.) |
Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007  |
Algebraic Methods in Computational Complexity  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Julia Kempe, Oded Regev, Ben Toner |
The Unique Games Conjecture with Entangled Provers is False.  |
Algebraic Methods in Computational Complexity  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf |
07411 Abstracts Collection -- Algebraic Methods in Computational Complexity.  |
Algebraic Methods in Computational Complexity  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf |
07411 Executive Summary -- Algebraic Methods in Computational Complexity.  |
Algebraic Methods in Computational Complexity  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Farid M. Ablayev |
Classical Simulation Complexity of Quantum Branching Programs.  |
Algebraic Methods in Computational Complexity  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Nitin Saxena |
Diagonal Circuit Identity Testing and Lower Bounds.  |
Algebraic Methods in Computational Complexity  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Frederic Green, Amitabha Roy |
Uniqueness of Optimal Mod 3 Circuits for Parity.  |
Algebraic Methods in Computational Complexity  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Nikolai K. Vereshchagin, Harry Buhrman, Matthias Christandl, Michal Koucký, Zvi Lotker, Boaz Patt-Shamir |
High Entropy Random Selection Protocols.  |
Algebraic Methods in Computational Complexity  |
2007 |
DBLP BibTeX RDF |
|
| 1 | Harry Buhrman, Lance Fortnow, Thomas Thierauf (eds.) |
Algebraic Methods in Computational Complexity, 10.-15. October 2004  |
Algebraic Methods in Computational Complexity  |
2005 |
DBLP BibTeX RDF |
|
| 1 | William I. Gasarch, Frank Stephan |
Finding Isolated Cliques by Queries -- An Approach to Fault Diagnosis with Many Faults.  |
Algebraic Methods in Computational Complexity  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Judy Goldsmith |
Preferences and Domination.  |
Algebraic Methods in Computational Complexity  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler |
Randomized QuickSort and the Entropy of the Random Source.  |
Algebraic Methods in Computational Complexity  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Jörg Rothe |
Exact-Four-Colorability, Exact Domatic Number Problems, and the Boolean Hierarchy.  |
Algebraic Methods in Computational Complexity  |
2004 |
DBLP BibTeX RDF |
|
| 1 | Harry Buhrman, Lance Fortnow, Thomas Thierauf |
04421 Abstracts Collection - Algebraic Methods in Computational Complexity.  |
Algebraic Methods in Computational Complexity  |
2004 |
DBLP BibTeX RDF |
|
| 1 | William I. Gasarch, James Glenn, Andrey Utis |
The communication complexity of the Exact-N Problem revisited.  |
Algebraic Methods in Computational Complexity  |
2004 |
DBLP BibTeX RDF |
|
Displaying result #1 - #15 of 15 (100 per page; Change: )
|
|