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

From MaRDI portal
Added link to MaRDI item.
Merged Item from Q5326588
(4 intermediate revisions by 4 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 / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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

Revision as of 09:33, 6 May 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