|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 110 occurrences of 27 keywords
|
|
|
Results
Found 53 publication records. Showing 53 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
48 | Arnold Beckmann |
Resolution Refutations and Propositional Proofs with Height-Restrictions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL, Edinburgh, Scotland, UK, September 22-25, 2002, Proceedings, pp. 599-612, 2002, Springer, 3-540-44240-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Height of proofs, Length of proofs, Resolution refutation, Frege systems, Order induction principle, Cut introduction, MSC: Primary 03F20, Secondary 03F07, 68R99, Cut elimination, 68Q15, Bounded arithmetic, Propositional calculus |
48 | Martin Hofmann 0001 |
The Strength of Non-size-increasing Computation (Introduction and Summary). ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2001, 26th International Symposium, MFCS 2001 Marianske Lazne, Czech Republic, August 27-31, 2001, Proceedings, pp. 58-61, 2001, Springer, 3-540-42496-2. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
semantics AMS Classification: 03D15, 03C13, computational complexity, 68Q15, higher-order functions, finite model, 68Q55 |
18 | Peter Bürgisser, Felipe Cucker |
Exotic Quantifiers, Complexity Classes, and Complete Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Found. Comput. Math. ![In: Found. Comput. Math. 9(2), pp. 135-170, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 68Q15, 68Q17 |
18 | Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka |
The Black-Box Query Complexity of Polynomial Summation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 18(1), pp. 59-79, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Subject classification. 68Q05, 68Q17, 68Q25, 68Q15 |
18 | 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 |
18 | Aduri Pavan, N. V. Vinodchandran |
2-Local Random Reductions to 3-Valued Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 17(4), pp. 501-514, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
68Q17, Subject classification. 68Q15 |
18 | Lance Fortnow, Russell Impagliazzo, Valentine Kabanets, Christopher Umans |
On the Complexity of Succinct Zero-Sum Games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 17(3), pp. 353-376, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
91A05, 68Q17, Subject classification. 68Q15, 03D15, 68Q32 |
18 | 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 |
18 | John M. Hitchcock, Aduri Pavan |
Hardness Hypotheses, Derandomization, and Circuit Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 17(1), pp. 119-146, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
68Q30, 68Q17, Subject classification. 68Q15 |
18 | 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 |
18 | Alexander A. Sherstov |
Halfspace Matrices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 17(2), pp. 149-178, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Subject classification. 03D15, 68Q17, 68Q15 |
18 | R. Ryan Williams |
Time-Space Tradeoffs for Counting NP Solutions Modulo Integers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 17(2), pp. 179-219, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
68Q17, Subject classification. 68Q15 |
18 | Xiaoyang Gu, Jack H. Lutz |
Dimension Characterizations of Complexity Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 17(4), pp. 459-474, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Subject classification, 68Q15 |
18 | Marius Zimand |
Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 17(2), pp. 220-253, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Subject classification, 68Q15 |
18 | Shahar Sarid, Amir Shapiro |
Classifying the multi robot path finding problem into a quadratic competitive complexity class. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Ann. Math. Artif. Intell. ![In: Ann. Math. Artif. Intell. 52(2-4), pp. 169-203, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 68Q25, 68T40, 11Y16, 93C85, 68Q17, 68Q15, 68W40, 68W15 |
18 | Masahiro Kumabe, Toshio Suzuki, Takeshi Yamazaki |
Does truth-table of linear norm reduce the one-query tautologies to a random oracle? ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 47(2), pp. 159-180, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 68Q15, 03D15 |
18 | Manuel Lameiras Campagnolo, Kerry Ojakian |
The elementary computable functions over the real numbers: applying two new techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 46(7-8), pp. 593-627, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 68Q15 |
18 | Martin Beaudry, Markus Holzer 0001 |
The Complexity of Tensor Circuit Evaluation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 16(1), pp. 60-111, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Subject classification. 15A69, 68Q70, 68Q17, 68Q15, 68Q05 |
18 | 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 |
18 | Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh 0001 |
Communication vs. Computation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 16(1), pp. 1-33, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
68Q17, Subject classification. 68Q15 |
18 | 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 |
18 | Rocco A. Servedio |
Every Linear Threshold Function has a Low-Weight Approximator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 16(2), pp. 180-209, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Subject classification. 06E30, 52C07, 52C35, 68Q15, 68Q32 |
18 | Neeraj Kayal, Nitin Saxena 0001 |
Polynomial Identity Testing for Depth 3 Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 16(2), pp. 115-138, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
13P99, Subject classification. 68Q15 |
18 | Pierre McKenzie, Klaus W. Wagner |
The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 16(3), pp. 211-244, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Subject classification. 68Q25, 68Q15, 03D15 |
18 | Satoru Kuroda |
Generalized quantifier and a bounded arithmetic theory for LOGCFL. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 46(5-6), pp. 489-516, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 03F30, 68Q15 |
18 | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz |
Computationally Private Randomizing Polynomials and Their Applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 15(2), pp. 115-162, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Subject classification. 94A60, 68P25, 68Q15 |
18 | Chris Pollett |
Languages to diagonalize against advice classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 14(4), pp. 341-361, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Subject classification. 68Q15, 03D15 |
18 | 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 |
18 | Peter Bürgisser, Felipe Cucker, Paulin Jacobé de Naurois |
The complexity of semilinear problems in succinct representation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 15(3), pp. 197-235, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Subject classification, 68Q15 |
18 | Matthias Krause 0001 |
On the computational power of Boolean decision lists. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 14(4), pp. 362-375, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
94C05, Subject classification. 68Q15, 06E30, 94C10 |
18 | Neeraj Kayal, Nitin Saxena 0001 |
Complexity of Ring Morphism Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 15(4), pp. 342-390, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
13P99, Subject classification. 68Q15 |
18 | Ronen Shaltiel, Christopher Umans |
Pseudorandomness for Approximate Counting and Sampling. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 15(4), pp. 298-341, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Subject classification, 68Q15 |
18 | Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson |
Reducing The Seed Length In The Nisan-Wigderson Generator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 26(6), pp. 647-681, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 68Q15 |
18 | Peter Bro Miltersen, N. V. Vinodchandran |
Derandomizing Arthur-Merlin Games using Hitting Sets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 14(3), pp. 256-279, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
68Q17, Subject classification. 68Q15 |
18 | Pascal Koiran |
Valiant's model and the cost of computing integers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 13(3-4), pp. 131-146, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
68Q17, Subject classification. 68Q15, 03D15 |
18 | 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 |
18 | Lars Kristiansen |
Neat function algebraic characterizations of logspace and linspace. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 14(1), pp. 72-88, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
03D10, Subject classification. 68Q15, 68Q05, 03D20 |
18 | Leonard J. Schulman, Vijay V. Vazirani |
A Computationally Motivated Definition Of Parametric Estimation And Its Applications To The Gaussian Distribution. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 25(4), pp. 465-486, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 68Q15, 68W20, 62F25, 68Q25, 68W25 |
18 | Toshio Suzuki |
Bounded truth table does not reduce the one-query tautologies to a random oracle. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 44(6), pp. 751-762, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 68Q15, 03D15 |
18 | Satoru Kuroda |
Recursion Schemata for Slowly Growing Depth Circuit Classes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 13(1-2), pp. 69-89, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Subject classification. 03D20, 94C99, 68Q15 |
18 | 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 |
18 | John Watrous |
On the complexity of simulating space-bounded quantum computations. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 12(1-2), pp. 48-84, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000). 03D15, 68Q15 |
18 | Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma |
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 12(3-4), pp. 85-130, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000). 68Q15 |
18 | Ronen Shaltiel |
Towards proving strong direct product theorems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 12(1-2), pp. 1-22, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000). 68Q17, 68Q15 |
18 | Carsten Damm, Markus Holzer 0001, Pierre McKenzie |
The complexity of tensor calculus. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 11(1-2), pp. 54-89, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000). 15A69, 68Q70, 68Q17, 68Q15, 68Q05 |
18 | Lance Fortnow, John D. Rogers |
Separability and one-way functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 11(3-4), pp. 137-157, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000). 68Q15 |
18 | 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 |
18 | Erez Petrank, Gábor Tardos |
On the Knowledge Complexity of NP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 22(1), pp. 83-121, 2002. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000) Classes: 68Q15, 68Q17 |
18 | Anna Gál |
A characterization of span program size and improved lower bounds for monotone span programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comput. Complex. ![In: Comput. Complex. 10(4), pp. 277-296, 2001. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
Span programs, Boolean formula size, secret sharing..¶ Subject classification. 68Q15, lower bounds, 94C10 |
18 | Karl-Heinz Niggl |
The m\mu-measure as a tool for classifying computational complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 39(7), pp. 515-539, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 03D15, 68Q15, 68Q42, 03D20 |
18 | Ran Raz, Pierre McKenzie |
Separation of the Monotone NC Hierarchy. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 19(3), pp. 403-435, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 68Q15, 68R99, 68Q25 |
18 | Martin Grohe |
Equivalence in Finite-Variable Logics is Complete for Polynomial Time. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Comb. ![In: Comb. 19(4), pp. 507-532, 1999. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (1991) Classes: 03C13, 05C60, 68Q15 |
18 | 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 - #53 of 53 (100 per page; Change: )
|
|