Lifting lower bounds for tree-like proofs

Alexis Maciel; Phuong Nguyen; Toniann Pitassi

doi:10.1007/s00037-013-0064-x

ScienceGate Book Chapters

JOURNAL ARTICLE

Lifting lower bounds for tree-like proofs

Alexis Maciel Phuong Nguyen Toniann Pitassi

Year: 2013 Journal: Computational Complexity Vol: 23 (4)Pages: 585-636 Publisher: Birkhäuser

DOI: 10.1007/s00037-013-0064-x

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematical proof Proof complexity Mathematics Constant (computer programming) Upper and lower bounds Bounded function Discrete mathematics Sequent Tree (set theory) Sequent calculus Hierarchy Combinatorics Computer science

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.10

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Logic, programming, and type systems

Physical Sciences → Computer Science → Artificial Intelligence

Formal Methods in Verification

Physical Sciences → Computer Science → Computational Theory and Mathematics

Logic, Reasoning, and Knowledge

Physical Sciences → Computer Science → Artificial Intelligence

Lifting lower bounds for tree-like proofs

Metrics

Citation History

Topics

Related Documents

Upper and lower bounds for tree-like cutting planes proofs

Models of lower-bounds proofs

Simplified Lower Bounds for Propositional Proofs

Exponential lower bounds for the tree-like Hajós calculus

Lower bounds on Nullstellensatz proofs via designs