|
|
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 |
24 | Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka |
The Black-Box Query Complexity of Polynomial Summation. |
Comput. Complex. |
2009 |
DBLP DOI BibTeX RDF |
Subject classification. 68Q05, 68Q17, 68Q25, 68Q15 |
24 | Howard A. Blair, Victor W. Marek, Jeffrey B. Remmel |
Set based logic programming. |
Ann. Math. Artif. Intell. |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 68Q05, 68T99, 03D99 |
24 | Martin Beaudry, Markus Holzer 0001 |
The Complexity of Tensor Circuit Evaluation. |
Comput. Complex. |
2007 |
DBLP DOI BibTeX RDF |
Subject classification. 15A69, 68Q70, 68Q17, 68Q15, 68Q05 |
24 | Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay |
Circuits on cylinders. |
Comput. Complex. |
2006 |
DBLP DOI BibTeX RDF |
Subject classification. 68Q05, 68Q70 |
24 | Lars Kristiansen |
Neat function algebraic characterizations of logspace and linspace. |
Comput. Complex. |
2005 |
DBLP DOI BibTeX RDF |
03D10, Subject classification. 68Q15, 68Q05, 03D20 |
24 | Takashi Mihara, Shao Chin Sung |
Deterministic polynomial-time quantum algorithms for Simon's problem. |
Comput. Complex. |
2003 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000). 03D15, 81P68, 68Q25, 68Q05 |
24 | Carsten Damm, Markus Holzer 0001, Pierre McKenzie |
The complexity of tensor calculus. |
Comput. Complex. |
2002 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000). 15A69, 68Q70, 68Q17, 68Q15, 68Q05 |
24 | 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 |
24 | Michael H. Freedman |
Quantum Computation and the Localization of Modular Functors. |
Found. Comput. Math. |
2001 |
DBLP DOI BibTeX RDF |
AMS Classification, Primary 57R56, Secondary 68Q05, 81Q70, 82B10, 94B99, 20F36 |
24 | László Babai, Thomas P. Hayes, Peter G. Kimmel |
The Cost of the Missing Bit: Communication Complexity with Help. |
Comb. |
2001 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 68Q05, 11K38, 94A99, 68R05, 03D15 |
24 | Oded Goldreich 0001, Shafi Goldwasser, Eric Lehman, Dana Ron, Alex Samorodnitsky |
Testing Monotonicity. |
Comb. |
2000 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 68Q25, 68R05, 68Q05 |
24 | László Babai, Anna Gál, Avi Wigderson |
Superpolynomial Lower Bounds for Monotone Span Programs. |
Comb. |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 68Q05, 68R05, 05D05 |
24 | 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 |
Displaying result #1 - #13 of 13 (100 per page; Change: )
|
|