Algebraic proofs over noncommutative formulas (Q642520): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Space Complexity in Propositional Calculus / 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: Random CNF's are hard for the polynomial calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear gaps between degrees for the polynomial calculus modulo distinct primes / 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: Q4228469 / 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: Algebraic proof systems over formulas. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the polynomial calculus and the Gröbner basis algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Black-Box Identity Testing $pi$-Ordered Algebraic Branching Programs / 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: 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: Q4353563 / 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: Q4934563 / 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: 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: Lower bounds for the polynomial calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the descriptive and algorithmic power of parity ordered binary decision diagrams / rank
 
Normal rank

Latest revision as of 14:42, 4 July 2024

scientific article
Language Label Description Also known as
English
Algebraic proofs over noncommutative formulas
scientific article

    Statements

    Algebraic proofs over noncommutative formulas (English)
    0 references
    0 references
    27 October 2011
    0 references
    0 references
    proof complexity
    0 references
    algebraic proof systems
    0 references
    Frege proofs
    0 references
    lower bounds
    0 references
    noncommutative formulas
    0 references
    polynomial calculus
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references