The Complexity of Symmetric Boolean Parity Holant Problems (Q5892610): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q600246 / rank
Normal rank
 
Property / author
 
Property / author: Leslie G. Valiant / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-22006-7_60 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1271872764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Isomorphism is in SPP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy theorem for constraint satisfaction problems on a 3-element set / 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: Graph Homomorphisms with Complex Values: A Dichotomy Theorem / 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: Q3549638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signature Theory in Holographic Algorithms / 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: 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: Complexity Classifications of Boolean Constraint Satisfaction Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of generalized satisfiability counting 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: 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: Q5390002 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113689 / 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: Q4743737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP is as easy as detecting unique solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / 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
Property / cites work
 
Property / cites work: Some Observations on Holographic Algorithms / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:51, 4 July 2024

scientific article; zbMATH DE number 5918005
Language Label Description Also known as
English
The Complexity of Symmetric Boolean Parity Holant Problems
scientific article; zbMATH DE number 5918005

    Statements

    The Complexity of Symmetric Boolean Parity Holant Problems (English)
    0 references
    0 references
    0 references
    0 references
    6 July 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references