Proof Complexity Meets Algebra (Q4617977): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2905780568 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1711.07320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space Complexity in Propositional Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Affine systems of equations and counting infinitary logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial characterization of resolution width / 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: Narrow Proofs May Be Maximally Long / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof complexity meets algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE CONSTRAINT SATISFACTION PROBLEM AND UNIVERSAL ALGEBRA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Satisfaction Problems Solvable by Local Consistency Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4993594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The wonderland of reflections / 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: Hard examples for bounded depth frege / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3304105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying the Complexity of Constraints Using Finite Algebras / 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: Approximation Resistance from Pairwise-Independent Subgroups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5144655 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic proof systems over formulas. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4807964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander graphs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability and Learnability Arising from Algebras with Few Subpowers / 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: Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the weak pigeonhole principle / 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: A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4353563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4152212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5144633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Sherali--Adams Relaxations for General-Valued CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSP gaps and reductions in the lasserre hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Proof of the CSP Dichotomy Conjecture / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:01, 18 July 2024

scientific article; zbMATH DE number 7014566
Language Label Description Also known as
English
Proof Complexity Meets Algebra
scientific article; zbMATH DE number 7014566

    Statements

    Proof Complexity Meets Algebra (English)
    0 references
    0 references
    0 references
    7 February 2019
    0 references
    constraint satisfaction problem
    0 references
    gap theorems
    0 references
    proof complexity
    0 references
    reductions
    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