|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 46 occurrences of 17 keywords
|
|
|
Results
Found 18 publication records. Showing 18 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
23 | Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, Thomas Vidick |
Using Entanglement in Quantum Multi-Prover Interactive Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 18(2), pp. 273-307, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Subject classification. 03D15, 81P68, 68Q15, 68Q10 |
23 | Oded Lachish, Ilan Newman, Asaf Shapira |
Space Complexity Vs. Query Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 17(1), pp. 70-93, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Subject classification. 68Q15, 68Q10 |
23 | Alexander Healy |
Randomness-Efficient Sampling within NC1. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 17(1), pp. 3-37, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
68Q15, 68R10, Subject classification. 68Q10 |
23 | Richard Cleve, William Slofstra, Falk Unger, Sarvagya Upadhyay |
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 17(2), pp. 282-299, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Subject classification. 81P68, 68Q10 |
23 | Andrea Corradini 0001, Frank Hermann 0001, Pawel Sobocinski 0001 |
Subobject Transformation Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Categorical Struct. ![In: Appl. Categorical Struct. 16(3), pp. 389-419, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 18B35, 68Q10, 68Q42 |
23 | Luca Trevisan, Salil P. Vadhan |
Pseudorandomness and Average-Case Complexity Via Uniform Reductions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 16(4), pp. 331-364, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Subject classification, 68Q10 |
23 | Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma |
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 16(4), pp. 412-441, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
68Q17, 68Q15, 94A60, Subject classification. 68Q10 |
23 | Dieter van Melkebeek, Konstantin Pervyshev |
A Generic Time Hierarchy with One Bit of Advice. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 16(2), pp. 139-179, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Subject classification. 68Q15, 68Q10 |
23 | Paul Beame, Toniann Pitassi, Nathan Segerlind, Avi Wigderson |
A Strong Direct Product Theorem for Corruption and the Multiparty Communication Complexity of Disjointness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 15(4), pp. 391-432, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
06D15, 68Q17, 68Q15, 06E30, Subject classification. 68Q10 |
23 | Chris Marriott, John Watrous |
Quantum Arthur-Merlin games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 14(2), pp. 122-152, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
68Q15, Subject classification. 68Q10 |
23 | Joe Kilian, Charles Rackoff, Erez Petrank |
Lower Bounds For Concurrent Zero Knowledge*. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 25(2), pp. 217-249, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 68Q17, 68Q10, 68Q85 |
23 | Valentine Kabanets, Russell Impagliazzo |
Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 13(1-2), pp. 1-46, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
68Q17, 68Q15, Subject classification. 68Q10 |
23 | Sanjeev Arora, Madhu Sudan 0001 |
Improved Low-Degree Testing and its Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 23(3), pp. 365-426, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000): 68Q10, 68Q17 |
23 | Oded Goldreich 0001, Salil P. Vadhan, Avi Wigderson |
On interactive proofs with a laconic prover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 11(1-2), pp. 1-53, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000). 68Q05, 91A05, 68Q15, 68Q10 |
23 | Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky |
The Linear-Array Conjecture in Communication Complexity Is False. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 19(2), pp. 241-254, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 68Q22, 68Q10, 94A05 |
23 | Karl-Heinz Niggl |
Subrecursive functions on partial sequences. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 38(3), pp. 163-193, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (1991): 03D15, 03D45, 03D65, 03D99, 68Q99, 68Q25, 68Q10, 68Q55, 68Q45, 03D20 |
23 | Pranay Chaudhuri |
An $O(n^2)$ Self-Stabilizing Algorithm for Computing Bridge-Connected Components. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Computing ![In: Computing 62(1), pp. 55-67, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classifications: 05C85, 68Q22, 68Q25, 68Q10 |
23 | Karl-Heinz Niggl |
A restricted computation model on Scott domains and its partial primitive recursive functionals. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 37(7), pp. 443-481, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (1991):03D15, 03D65, 03D99, 68Q99, 68Q15, 68Q10, 68Q55, 68Q05, 03D20 |
Displaying result #1 - #18 of 18 (100 per page; Change: )
|
|