Search results for "03F20"

Found 11 publication records. Showing 11 according to the selection in the facets

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
58	Arnold Beckmann	Resolution Refutations and Propositional Proofs with Height-Restrictions.	CSL	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
25	Ran Raz, Iddo Tzameret	The Strength of Multilinear Proofs.	Comput. Complex.	2008	DBLP DOI BibTeX RDF	Subject classification. 03F20, 68Q17, 13P10
25	Pavel Naumov	On meta complexity of propositional formulas and propositional proofs.	Arch. Math. Log.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 03F20
25	Paul Beame, Russell Impagliazzo, Ashish Sabharwal	The Resolution Complexity of Independent Sets and Vertex Covers in Random Graphs.	Comput. Complex.	2007	DBLP DOI BibTeX RDF	Subject classification. 03F20, 68Q17
25	Maria Luisa Bonet, Carlos Domingo, Ricard Gavaldà, Alexis Maciel, Toniann Pitassi	Non-Automatizability of Bounded-Depth Frege Proofs.	Comput. Complex.	2004	DBLP DOI BibTeX RDF	Subject classification. 03F20, 68Q17, 68T15
25	Eli Ben-Sasson, Russell Impagliazzo, Avi Wigderson	Near Optimal Separation Of Tree-Like And General Resolution.	Comb.	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 03F20, 68Q17
25	Toniann Pitassi, Ran Raz	Regular Resolution Lower Bounds For The Weak Pigeonhole Principle.	Comb.	2004	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 03F20, 68Q17
25	Eli Ben-Sasson	Hard examples for the bounded depth Frege proof system.	Comput. Complex.	2002	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000). 03F20
25	Alexander A. Razborov, Avi Wigderson, Andrew Chi-Chih Yao	Read-Once Branching Programs, Rectangular Proofs of the Pigeonhole Principle and the Transversal Calculus.	Comb.	2002	DBLP DOI BibTeX RDF	AMS Subject Classification (2000): 03F20, 68Q17
25	Maria Luisa Bonet, Nicola Galesi	Optimality of size-width tradeoffs for resolution.	Comput. Complex.	2001	DBLP DOI BibTeX RDF	complexity of proofs, automated theorem proving.¶ Subject classification. 03F20, 03B05, Resolution, 68T15
25	Matthias Baaz, Richard Zach	Note on generalizing theorems in algebraically closed fields.	Arch. Math. Log.	1998	DBLP DOI BibTeX RDF	Mathematics Subject Classification:03F07, 03F20, 12L99