Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase res(k) (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1984-2006 (9)
Publication types (Num. hits)
article(1) inproceedings(8)
Venues (Conferences, Journals, ...)
CCC(2) CSL(1) European Workshop on Applicati...(1) FOCS(1) ICALP(1) Inf. Process. Lett.(1) SAT(1) STOC(1)
Authors
Nathan Segerlind(3) Nicola Galesi(2) Russell Impagliazzo(2) Albert Atserias(1) Alexander S. Kulikov(1) Arist Kojevnikov(1) Jochen Messner(1) Juan Luis Esteban(1) Maria Luisa Bonet(1) Matthias Jantzen(1) Michael Alekhnovich(1) Neil Thapen(1) Paul Beame(1) Rüdiger Valk(1) Samuel R. Buss(1) Toniann Pitassi(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 1 occurrences of 1 keywords
Results
Found 9 publication records. Showing 9 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
82Nathan Segerlind, Samuel R. Buss, Russell Impagliazzo A Switching Lemma for Small Restrictions and Lower Bounds for k - DNF Resolution. Search on Bibsonomy FOCS The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
68Juan Luis Esteban, Nicola Galesi, Jochen Messner On the Complexity of Resolution with Bounded Conjunctions. Search on Bibsonomy ICALP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
58Michael Alekhnovich Lower bounds for k-DNF resolution on random 3-CNFs. Search on Bibsonomy STOC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF random 3CNF, res(k), resolution
54Albert Atserias, Maria Luisa Bonet On the Automatizability of Resolution and Related Propositional Proof Systems. Search on Bibsonomy CSL The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
37Nathan Segerlind Exponential separation between Res(k) and Res(k+1) for k leq varepsilonlogn. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
27Arist Kojevnikov, Alexander S. Kulikov Complexity of Semialgebraic Proofs with Restricted Degree of Falsity. Search on Bibsonomy SAT The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
14Nicola Galesi, Neil Thapen The Complexity of Treelike Systems over lamda-Local Formulae. Search on Bibsonomy CCC The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
14Paul Beame, Russell Impagliazzo, Toniann Pitassi, Nathan Segerlind Memoization and DPLL: Formula Caching Proof Systems. Search on Bibsonomy CCC The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
14Rüdiger Valk, Matthias Jantzen The residue of vector sets with applications to decidability problems in Petri nets. Search on Bibsonomy European Workshop on Applications and Theory in Petri Nets The full citation details ... 1984 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #9 of 9 (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