The complexity of planar Boolean \#CSP with complex weights (Q2009629): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
aliases / en / 0aliases / en / 0
 
The Complexity of Planar Boolean #CSP with Complex Weights
description / endescription / en
scientific article
scientific article; zbMATH DE number 6195452
Property / title
 
The Complexity of Planar Boolean #CSP with Complex Weights (English)
Property / title: The Complexity of Planar Boolean #CSP with Complex Weights (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1336.68128 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-642-39206-1_44 / rank
 
Normal rank
Property / published in
 
Property / published in: Automata, Languages, and Programming / rank
 
Normal rank
Property / publication date
 
6 August 2013
Timestamp+2013-08-06T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 6 August 2013 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C10 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6195452 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2967145908 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1503285044 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1212.2284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3324796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012032 / 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: Towards a dichotomy theorem for 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: Some Results on Matchgates and Holographic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the theory of matchgate computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3191606 / 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: A complete dichotomy rises from the capture of vanishing signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spin Systems on Graphs with Complex Edge Functions and Specified Degree Regularities / 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: Gadgets and anti-gadgets leading to a complexity dichotomy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On symmetric signatures in holographic algorithms / 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: 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 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: Q4521549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / 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: The Complexity of Symmetric Boolean Parity Holant Problems / 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: A dichotomy for real weighted Holant problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beitrag zur Theorie des Ferromagnetismus / rank
 
Normal rank
Property / cites work
 
Property / cites work: The statistics of dimers on a lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5605168 / 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: Statistical Theory of Equations of State and Phase Transitions. II. Lattice Gas and Ising Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crystal Statistics. I. A Two-Dimensional Model with an Order-Disorder Transition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimer problem in statistical mechanics-an exact result / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3188969 / 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: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressiveness of matchgates. / 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: On the evaluation at (3,3) of the Tutte polynomial of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Tutte Invariants for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Spontaneous Magnetization of a Two-Dimensional Ising Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Statistical Theory of Equations of State and Phase Transitions. I. Theory of Condensation / rank
 
Normal rank

Latest revision as of 04:29, 21 July 2024

scientific article; zbMATH DE number 6195452
  • The Complexity of Planar Boolean #CSP with Complex Weights
Language Label Description Also known as
English
The complexity of planar Boolean \#CSP with complex weights
scientific article; zbMATH DE number 6195452
  • The Complexity of Planar Boolean #CSP with Complex Weights

Statements

The complexity of planar Boolean \#CSP with complex weights (English)
0 references
The Complexity of Planar Boolean #CSP with Complex Weights (English)
0 references
0 references
0 references
0 references
0 references
29 November 2019
0 references
6 August 2013
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
counting complexity
0 references
constraint satisfaction problems
0 references
\#P
0 references
dichotomy
0 references
planar graphs
0 references
holographic algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references