Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits (Q898252): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2171050449 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1311.4066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorings and orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the counting constraint satisfaction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Algorithm for Mal'tsev Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a dichotomy theorem for the counting constraint satisfaction problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of weighted Boolean \#CSP with mixed signs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of partition functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of counting CSP with complex weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5198636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valiant's holant theorem and matchgate tensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Holant Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete dichotomy rises from the capture of vanishing signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gadgets and anti-gadgets leading to a complexity dichotomy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holant problems and counting CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dichotomy for Holant Problems with a Function on Domain Size 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of complex weighted Boolean \#CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Weighted Boolean #CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of #CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Dichotomy for the Counting Constraint Satisfaction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of planar Boolean \#CSP with complex weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic algorithms without matchgates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing Combinatorial Problems by Systems of Polynomial Equations and Hilbert's Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable sets and polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized counting constraint satisfaction problems with determinantal circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere-zero flow polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Circuits That Can Be Simulated Classically in Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic Algorithms / rank
 
Normal rank

Latest revision as of 04:56, 11 July 2024

scientific article
Language Label Description Also known as
English
Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits
scientific article

    Statements

    Polynomial-time solvable \(\#\)CSP problems via algebraic models and Pfaffian circuits (English)
    0 references
    0 references
    8 December 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    dichotomy theorems
    0 references
    Gröbner bases
    0 references
    computer algebra
    0 references
    \(\#\)CSP
    0 references
    polynomial ideals
    0 references
    0 references
    0 references
    0 references
    0 references