Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Authors
(202)
Toniann Pitassi
13
Eli BenSasson
11
Alexander A. Razborov
11
Nicola Galesi
9
RUSSELL IMPAGLIAZZO
9
Conferences
(28)
CoCo
5
STOC
4
CSL
4
FOCS
4
TAMC
4
Journals
(35)
ECCC
15
APAL
13
TCS
13
CORR
9
JSYML
8
Keywords
(20)
Subscribe
Academic
Keywords
Proof Complexity
,Proof Complexity,Proofs Complexity,proof complex,proof complexities
Proof Complexity
Publications: 228

Citation Count: 1,448
Stemming Variations:
Proofs Complexity, proof complex, proof complexities
Cumulative
Annual
Definition Context
(2)
Proof complexity is an interdisciplinary area of research utilizing techniques from logic, complexity, and combinatorics towards the main aim of understanding the complexity of theorem proving procedures. Traditionally, propositional proofs have been the main object of investigation in proof complexity. Due their richer expressivity and numerous applications within computer science, also nonclassical logics have been intensively studied from a proof complexity perspective in the last decade, and a number of impressive results have been obtained...
Olaf Beyersdorff
.
Proof Complexity of Nonclassical Logics
Proof complexity is a research area that studies the concept of complexity from the point of view of logic...
Pavel Pudlák
.
Twelve Problems in Proof Complexity
Sort by:
Publications
(228)
Short proofs for the determinant identities
Pavel Hrubes
,
Iddo Tzameret
Conference:
ACM Symposium on Theory of Computing  STOC
, pp. 193212, 2012
On the virtue of succinct proofs: amplifying communication complexity hardness to timespace tradeoffs in proof complexity
Trinh Huynh
,
Jakob Nordstrom
Published in 2012.
Timespace tradeoffs in resolution: superpolynomial lower bounds for superlinear space
Paul Beame
,
Christopher Beck
,
Russell Impagliazzo
Published in 2012.
On the Relative Strength of Pebbling and Resolution
Jakob Nordström
Journal:
ACM Transactions on Computational Logic  TOCL
, pp. 143, 2012
Analysis of autocatalytic networks in biology
(
Citations: 1
)
Gentian Buzi
,
Ufuk Topcu
,
John C. Doyle
Journal:
Automatica
, vol. 47, no. 6, pp. 11231130, 2011