Holographic algorithms by Fibonacci gates
From MaRDI portal
Exact enumeration problems, generating functions (05A15) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Recommendations
Cites work
- Basis collapse in holographic algorithms
- Complexity of generalized satisfiability counting problems
- Computational complexity of counting problems on 3-regular planar graphs
- Dimer problem in statistical mechanics-an exact result
- Holant problems and counting CSP
- Holographic Algorithms
- Holographic algorithms with matchgates capture precisely tractable planar \#CSP
- Holographic algorithms: from art to science
- Holographic algorithms: the power of dimensionality resolved
- scientific article; zbMATH DE number 52497 (Why is no real title available?)
- scientific article; zbMATH DE number 3326387 (Why is no real title available?)
- Quantum Circuits That Can Be Simulated Classically in Polynomial Time
- Some Results on Matchgates and Holographic Algorithms
- Tensor Geometry
- The complexity of computing the permanent
- The complexity of counting in sparse, regular, and planar graphs
- The Complexity of Enumeration and Reliability Problems
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
- Valiant's holant theorem and matchgate tensors
Cited in
(17)- Clifford gates in the Holant framework
- Holographic algorithms without matchgates
- Holographic reduction for some counting problems
- Holographic algorithms on bases of rank 2
- A dichotomy for real weighted Holant problems
- A complete dichotomy rises from the capture of vanishing signatures
- The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems
- Holant problems for 3-regular graphs with complex edge functions
- Some observations on holographic algorithms
- Characterizing partition functions of the edge-coloring model by rank growth
- On the Complexity of Holant Problems
- Holographic Algorithm with Matchgates Is Universal for Planar \#CSP over Boolean Domain
- Counting restricted homomorphisms via Möbius inversion over matroid lattices
- FPTAS for weighted Fibonacci gates and its applications
- Classification of a Class of Counting Problems Using Holographic Reductions
- The computational complexity of Holant problems on 3-regular graphs
- Dichotomy for non-negative valued Holant problems on 3-regular bipartite graphs
This page was built for publication: Holographic algorithms by Fibonacci gates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1931762)
