scientific article
From MaRDI portal
Publication:3549638
zbMath1232.68055MaRDI QIDQ3549638
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonnumerical algorithms (68W05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (19)
Constrained percolation in two dimensions ⋮ On blockwise symmetric matchgate signatures and higher domain \#CSP ⋮ On the theory of matchgate computations ⋮ On blockwise symmetric signatures for matchgates ⋮ Valiant's holant theorem and matchgate tensors ⋮ Classification of a Class of Counting Problems Using Holographic Reductions ⋮ \(P\) versus \(NP\) and geometry ⋮ Holographic algorithms by Fibonacci gates ⋮ Holographic algorithms without matchgates ⋮ Holographic algorithms: from art to science ⋮ Holographic reduction for some counting problems ⋮ Signature theory in holographic algorithms ⋮ A collapse theorem for holographic algorithms with matchgates on domain size at most 4 ⋮ Progress in Complexity of Counting Problems ⋮ A computational proof of complexity of some restricted counting problems ⋮ Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP ⋮ On symmetric signatures in holographic algorithms ⋮ The Complexity of Symmetric Boolean Parity Holant Problems ⋮ Holographic algorithms: the power of dimensionality resolved
This page was built for publication:
