Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > NON-COMMUTATIVE FORMULAS:
Reports tagged with non-commutative formulas:
TR15-134 | 19th August 2015
Fu Li, Iddo Tzameret, Zhengyu Wang

#### Characterizing Propositional Proofs as Non-Commutative Formulas

Does every Boolean tautology have a short propositional-calculus proof? Here, a propositional-calculus (i.e., Frege) proof is any proof starting from a set of axioms and deriving new Boolean formulas using a fixed set of sound derivation rules. Establishing any super-polynomial size lower bound on Frege proofs (in terms of the ... more >>>

TR21-094 | 6th July 2021
Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas

#### New Non-FPT Lower Bounds for Some Arithmetic Formulas

An Algebraic Formula for a polynomial $P\in F[x_1,\ldots,x_N]$ is an algebraic expression for $P(x_1,\ldots,x_N)$ using variables, field constants, additions and multiplications. Such formulas capture an algebraic analog of the Boolean complexity class $\mathrm{NC}^1.$ Proving lower bounds against this model is thus an important problem.

It is known that, to prove ... more >>>

ISSN 1433-8092 | Imprint