A Complete Dichotomy Rises from the Capture of Vanishing Signatures (Q2817798): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1204.6445 / 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: The complexity of the counting constraint satisfaction problem / 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: Complexity of counting CSP with complex weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Homomorphisms with Complex Values: A Dichotomy Theorem / 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: Holographic algorithms beyond matchgates / 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: Spin systems on \(k\)-regular graphs with complex edge functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition functions on \(k\)-regular graphs with \(\{0,1\}\)-vertex assignments and real edge functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic algorithms: from art to science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holant problems and counting CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Holant Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational proof of complexity of some restricted counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic reduction, interpolation and hardness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic algorithms by Fibonacci gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of generalized satisfiability counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Classifications of Boolean Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor Geometry / 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 counting homomorphisms to directed acyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4521549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of #CSP / 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: A Complexity Dichotomy for Partition Functions with Mixed Signs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Symmetric Boolean Parity Holant Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy for real weighted Holant problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4097411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes on graphs: normal realizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5605168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of a Class of Counting Problems Using Holographic Reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holant Problems for Regular Graphs with Complex Edge Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Polynomial Time Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operations with structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulating Quantum Computation by Contracting Tensor Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Counting in Sparse, Regular, and Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Holographic Algorithms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:59, 12 July 2024

scientific article
Language Label Description Also known as
English
A Complete Dichotomy Rises from the Capture of Vanishing Signatures
scientific article

    Statements

    A Complete Dichotomy Rises from the Capture of Vanishing Signatures (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 September 2016
    0 references
    0 references
    computational complexity
    0 references
    \#P
    0 references
    counting problems
    0 references
    dichotomy theorem
    0 references
    holographic algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references