Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > TSEITIN TAUTOLOGIES:
Reports tagged with Tseitin tautologies:
TR06-001 | 1st January 2006
Ran Raz, Iddo Tzameret

#### The Strength of Multilinear Proofs

We introduce an algebraic proof system that manipulates multilinear arithmetic formulas. We show that this proof system is fairly strong, even when restricted to multilinear arithmetic formulas of a very small depth. Specifically, we show the following:

1. Algebraic proofs manipulating depth 2 multilinear arithmetic formulas polynomially simulate Resolution, Polynomial ... more >>>

TR21-021 | 18th February 2021
Per Austrin, Kilian Risse

#### Average-Case Perfect Matching Lower Bounds from Hardness of Tseitin Formulas

We study the complexity of proving that a sparse random regular graph on an odd number of vertices does not have a perfect matching, and related problems involving each vertex being matched some pre-specified number of times. We show that this requires proofs of degree \$\Omega(n/\log n)\$ in the Polynomial ... more >>>

ISSN 1433-8092 | Imprint