Algebraic proofs over noncommutative formulas
From MaRDI portal
Recommendations
- Algebraic proofs over noncommutative formulas
- Algebra of proofs
- Characterizing propositional proofs as noncommutative formulas
- scientific article; zbMATH DE number 464655
- Non-commutative proof construction: a constraint-based approach
- A Nonstandard Proof of the Fundamental Theorem of Algebra
- Noncommutative algebraic varieties
- scientific article; zbMATH DE number 1745035
- scientific article; zbMATH DE number 3945335
- Noncommutative algebras in mathematics and its applications
Cites work
- scientific article; zbMATH DE number 1256733 (Why is no real title available?)
- scientific article; zbMATH DE number 1059248 (Why is no real title available?)
- scientific article; zbMATH DE number 1390276 (Why is no real title available?)
- Algebraic proof systems over formulas.
- An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagrams
- An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle
- Deterministic black-box identity testing \(\pi\)-ordered algebraic branching programs
- Deterministic polynomial identity testing in non-commutative models
- Exponential lower bounds for the pigeonhole principle
- Linear gaps between degrees for the polynomial calculus modulo distinct primes
- Lower bounds for the polynomial calculus
- Lower bounds for the polynomial calculus and the Gröbner basis algorithm
- Monotone simulations of non-monotone proofs.
- Multi-linear formulas for permanent and determinant are of super-polynomial size
- On the descriptive and algorithmic power of parity ordered binary decision diagrams
- Principles and Practice of Constraint Programming – CP 2004
- Proof complexity in algebraic systems and bounded depth Frege systems with modular counting
- Pseudorandom Generators in Propositional Proof Complexity
- Random CNF's are hard for the polynomial calculus
- Resolution over linear equations and multilinear proofs
- Separation of multilinear circuit and formula size
- Space Complexity in Propositional Calculus
- The relative efficiency of propositional proof systems
- The strength of multilinear proofs
Cited in
(4)
This page was built for publication: Algebraic proofs over noncommutative formulas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q642520)
