Search results for "68Q10"

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.	Comput. Complex.	2009	DBLP DOI BibTeX RDF	Subject classification. 03D15, 81P68, 68Q15, 68Q10
23	Oded Lachish, Ilan Newman, Asaf Shapira	Space Complexity Vs. Query Complexity.	Comput. Complex.	2008	DBLP DOI BibTeX RDF	Subject classification. 68Q15, 68Q10
23	Alexander Healy	Randomness-Efficient Sampling within NC1.	Comput. Complex.	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.	Comput. Complex.	2008	DBLP DOI BibTeX RDF	Subject classification. 81P68, 68Q10
23	Andrea Corradini 0001, Frank Hermann 0001, Pawel Sobocinski 0001	Subobject Transformation Systems.	Appl. Categorical Struct.	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.	Comput. Complex.	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.	Comput. Complex.	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.	Comput. Complex.	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.	Comput. Complex.	2006	DBLP DOI BibTeX RDF	06D15, 68Q17, 68Q15, 06E30, Subject classification. 68Q10
23	Chris Marriott, John Watrous	Quantum Arthur-Merlin games.	Comput. Complex.	2005	DBLP DOI BibTeX RDF	68Q15, Subject classification. 68Q10
23	Joe Kilian, Charles Rackoff, Erez Petrank	Lower Bounds For Concurrent Zero Knowledge*.	Comb.	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.	Comput. Complex.	2004	DBLP DOI BibTeX RDF	68Q17, 68Q15, Subject classification. 68Q10
23	Sanjeev Arora, Madhu Sudan 0001	Improved Low-Degree Testing and its Applications.	Comb.	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.	Comput. Complex.	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.	Comb.	1999	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 68Q22, 68Q10, 94A05
23	Karl-Heinz Niggl	Subrecursive functions on partial sequences.	Arch. Math. Log.	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.	Computing	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.	Arch. Math. Log.	1998	DBLP DOI BibTeX RDF	Mathematics Subject Classification (1991):03D15, 03D65, 03D99, 68Q99, 68Q15, 68Q10, 68Q55, 68Q05, 03D20