Linear gaps between degrees for the polynomial calculus modulo distinct primes (Q5943090): 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: Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs / 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: Q4375786 / 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: Good degree bounds on Nullstellensatz refutations of the induction principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3105730 / 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: On the degree of ideal membership proofs from uniform families of polynomials over a finite field / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4699287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4353563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the polynomial calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard examples for resolution / rank
 
Normal rank

Latest revision as of 19:46, 3 June 2024

scientific article; zbMATH DE number 1642218
Language Label Description Also known as
English
Linear gaps between degrees for the polynomial calculus modulo distinct primes
scientific article; zbMATH DE number 1642218

    Statements

    Linear gaps between degrees for the polynomial calculus modulo distinct primes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 March 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    mod \(p\) counting principle
    0 references
    satisfiability
    0 references
    lower bounds
    0 references
    minimum degree of polynomial calculus refutations
    0 references
    Tseitin's graph tautologies
    0 references
    Gröbner basis algorithm
    0 references
    0 references