On the automatizability of polynomial calculus (Q1959382): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Lower bounds for polynomial calculus in the case of nonbinomial ideals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution Is Not Automatizable Unless W[P] Is Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the automatizability of resolution and related propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exponential separation between the parity principle and the pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs are narrow—resolution made simple / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-automatizability of bounded-depth Frege proofs / 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: Q4228469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3413659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality of size-degree tradeoffs for polynomial calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / 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: Q4255576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4353563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On reducibility and symmetry of disjoint NP pairs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the polynomial calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3946078 / rank
 
Normal rank

Latest revision as of 07:42, 3 July 2024

scientific article
Language Label Description Also known as
English
On the automatizability of polynomial calculus
scientific article

    Statements

    On the automatizability of polynomial calculus (English)
    0 references
    0 references
    0 references
    6 October 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    automatizability
    0 references
    polynomial calculus
    0 references
    proof complexity
    0 references
    degree lower bound
    0 references
    0 references
    0 references