The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for 68Q05 with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1998-2009 (13)
Publication types (Num. hits)
article(13)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 27 occurrences of 11 keywords

Results
Found 13 publication records. Showing 13 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
24Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka The Black-Box Query Complexity of Polynomial Summation. Search on Bibsonomy Comput. Complex. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Subject classification. 68Q05, 68Q17, 68Q25, 68Q15
24Howard A. Blair, Victor W. Marek, Jeffrey B. Remmel Set based logic programming. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Mathematics Subject Classifications (2000) 68Q05, 68T99, 03D99
24Martin Beaudry, Markus Holzer 0001 The Complexity of Tensor Circuit Evaluation. Search on Bibsonomy Comput. Complex. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Subject classification. 15A69, 68Q70, 68Q17, 68Q15, 68Q05
24Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay Circuits on cylinders. Search on Bibsonomy Comput. Complex. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Subject classification. 68Q05, 68Q70
24Lars Kristiansen Neat function algebraic characterizations of logspace and linspace. Search on Bibsonomy Comput. Complex. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF 03D10, Subject classification. 68Q15, 68Q05, 03D20
24Takashi Mihara, Shao Chin Sung Deterministic polynomial-time quantum algorithms for Simon's problem. Search on Bibsonomy Comput. Complex. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000). 03D15, 81P68, 68Q25, 68Q05
24Carsten Damm, Markus Holzer 0001, Pierre McKenzie The complexity of tensor calculus. Search on Bibsonomy Comput. Complex. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000). 15A69, 68Q70, 68Q17, 68Q15, 68Q05
24Oded Goldreich 0001, Salil P. Vadhan, Avi Wigderson On interactive proofs with a laconic prover. Search on Bibsonomy Comput. Complex. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000). 68Q05, 91A05, 68Q15, 68Q10
24Michael H. Freedman Quantum Computation and the Localization of Modular Functors. Search on Bibsonomy Found. Comput. Math. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF AMS Classification, Primary 57R56, Secondary 68Q05, 81Q70, 82B10, 94B99, 20F36
24László Babai, Thomas P. Hayes, Peter G. Kimmel The Cost of the Missing Bit: Communication Complexity with Help. Search on Bibsonomy Comb. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF AMS Subject Classification (2000) Classes: 68Q05, 11K38, 94A99, 68R05, 03D15
24Oded Goldreich 0001, Shafi Goldwasser, Eric Lehman, Dana Ron, Alex Samorodnitsky Testing Monotonicity. Search on Bibsonomy Comb. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF AMS Subject Classification (1991) Classes: 68Q25, 68R05, 68Q05
24László Babai, Anna Gál, Avi Wigderson Superpolynomial Lower Bounds for Monotone Span Programs. Search on Bibsonomy Comb. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF AMS Subject Classification (1991) Classes: 68Q05, 68R05, 05D05
24Karl-Heinz Niggl A restricted computation model on Scott domains and its partial primitive recursive functionals. Search on Bibsonomy Arch. Math. Log. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (1991):03D15, 03D65, 03D99, 68Q99, 68Q15, 68Q10, 68Q55, 68Q05, 03D20
Displaying result #1 - #13 of 13 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license