Characterizing Propositional Proofs as Noncommutative Formulas (Q4577770): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: QUASIPOLYNOMIAL SIZE FREGE PROOFS OF FRANKL’S THEOREM ON THE TRACE OF SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Generators in Propositional Proof Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone simulations of non-monotone proofs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof complexity in algebraic systems and bounded depth Frege systems with modular counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Interpolation and Automatization for Frege Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Evaluation of General Arithmetic Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5306365 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4152212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative efficiency of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Untersuchungen über das logische Schliessen. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic proof systems over formulas. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuit Complexity, Proof Complexity, and Polynomial Identity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Proofs for the Determinant Identities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-commutative arithmetic circuits with division / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3072543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Witnessing matrix identities and proof complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527041 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential lower bounds for the pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4353563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unsolvable systems of equations and proof complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3758729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-linear formulas for permanent and determinant are of super-polynomial size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor-Rank and Lower Bounds for Arithmetic Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic polynomial identity testing in non-commutative models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution over linear equations and multilinear proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strength of multilinear proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4047029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5144645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic proofs over noncommutative formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3851616 / rank
 
Normal rank

Revision as of 05:46, 16 July 2024

scientific article; zbMATH DE number 6913594
Language Label Description Also known as
English
Characterizing Propositional Proofs as Noncommutative Formulas
scientific article; zbMATH DE number 6913594

    Statements

    Characterizing Propositional Proofs as Noncommutative Formulas (English)
    0 references
    0 references
    0 references
    0 references
    3 August 2018
    0 references
    proof complexity
    0 references
    algebraic circuits
    0 references
    Frege proofs
    0 references
    noncommutative formulas
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references