scientific article
From MaRDI portal
Publication:3113689
DOI10.4230/LIPIcs.STACS.2011.249zbMath1230.68080MaRDI QIDQ3113689
Mingji Xia, Sangxia Huang, Heng Guo, Pinyan Lu
Publication date: 23 January 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_8a2a.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items
On blockwise symmetric matchgate signatures and higher domain \#CSP, The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems, Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain, The complexity of complex weighted Boolean \#CSP, Unnamed Item, Holographic algorithms beyond matchgates, The Complexity of Symmetric Boolean Parity Holant Problems, Bipartite 3-regular counting problems with mixed signs, Bipartite 3-regular counting problems with mixed signs, A Complete Dichotomy Rises from the Capture of Vanishing Signatures, A dichotomy for real weighted Holant problems
