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

@@ Property / author @@
+Leslie G. Valiant
@@ Property / author: Leslie G. Valiant / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-22006-7_60
+Normal rank
@@ Property / OpenAlex ID @@
+W1271872764
@@ Property / OpenAlex ID: W1271872764 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Isomorphism is in SPP
@@ Property / cites work: Graph Isomorphism is in SPP / rank @@
+Normal rank
@@ Property / cites work @@
+Q4542538
@@ Property / cites work: Q4542538 / rank @@
+Normal rank
@@ Property / cites work @@
+A dichotomy theorem for constraint satisfaction problems on a 3-element set
+Normal rank
@@ Property / cites work @@
+The Complexity of the Counting Constraint Satisfaction Problem
+Normal rank
@@ Property / cites work @@
+Graph Homomorphisms with Complex Values: A Dichotomy Theorem
+Normal rank
@@ Property / cites work @@
+From Holant to #CSP and Back: Dichotomy for Holant c Problems
+Normal rank
@@ Property / cites work @@
+Q3549638
@@ Property / cites work: Q3549638 / rank @@
+Normal rank
@@ Property / cites work @@
+Signature Theory in Holographic Algorithms
@@ Property / cites work: Signature Theory in Holographic Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+A Computational Proof of Complexity of Some Restricted Counting Problems
+Normal rank
@@ Property / cites work @@
+Holant problems and counting CSP
@@ Property / cites work: Holant problems and counting CSP / rank @@
+Normal rank
@@ Property / cites work @@
+Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP
+Normal rank
@@ Property / cites work @@
+Complexity Classifications of Boolean Constraint Satisfaction Problems
+Normal rank
@@ Property / cites work @@
+Complexity of generalized satisfiability counting problems
+Normal rank
@@ Property / cites work @@
+Tensor Geometry
@@ Property / cites work: Tensor Geometry / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Weighted Boolean #CSP
@@ Property / cites work: The Complexity of Weighted Boolean #CSP / rank @@
+Normal rank
@@ Property / cites work @@
+On counting homomorphisms to directed acyclic graphs
+Normal rank
@@ Property / cites work @@
+The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
+Normal rank
@@ Property / cites work @@
+Q5390002
@@ Property / cites work: Q5390002 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3113689
@@ Property / cites work: Q3113689 / rank @@
+Normal rank
@@ Property / cites work @@
+Holant Problems for Regular Graphs with Complex Edge Functions
+Normal rank
@@ Property / cites work @@
+On the Structure of Polynomial Time Reducibility
@@ Property / cites work: On the Structure of Polynomial Time Reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+Q4743737
@@ Property / cites work: Q4743737 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy
+Normal rank
@@ Property / cites work @@
+NP is as easy as detecting unique solutions
@@ Property / cites work: NP is as easy as detecting unique solutions / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+Quantum Circuits That Can Be Simulated Classically in Polynomial Time
+Normal rank
@@ Property / cites work @@
+Holographic Algorithms
@@ Property / cites work: Holographic Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Some Observations on Holographic Algorithms
@@ Property / cites work: Some Observations on Holographic Algorithms / rank @@
+Normal rank