A graphical \#SAT algorithm for formulae with small clause density
From MaRDI portal
A graphical \SAT algorithm for formulae with small clause density
Cites work
- A categorical semantics of signal flow graphs
- A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics
- A diagrammatic axiomatisation for qubit entanglement
- A machine program for theorem-proving
- A near-minimal axiomatisation of ZX-calculus for pure qubit quantum mechanics
- A practical introduction to tensor networks: Matrix product states and projected entangled pair states
- A string diagrammatic axiomatisation of finite-state automata
- A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
- Algorithms and Computation
- Algorithms for Counting 2-Sat Solutions and Colorings with Applications
- An algebraic axiomatisation of ZX-calculus
- Classical simulation of quantum circuits with partial and graphical stabiliser decompositions
- Counting the number of solutions for instances of satisfiability
- Gap-definable counting classes
- Graphical affine algebra
- Graphical piecewise-linear algebra
- scientific article; zbMATH DE number 7449972 (Why is no real title available?)
- scientific article; zbMATH DE number 7449988 (Why is no real title available?)
- scientific article; zbMATH DE number 1315584 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- scientific article; zbMATH DE number 7724262 (Why is no real title available?)
- Interacting Hopf algebras
- Interacting Quantum Observables
- Interacting quantum observables: categorical algebra and diagrammatics
- New upper bound for the \#3-SAT problem
- Picturing Counting Reductions with the ZH-Calculus
- PP is as Hard as the Polynomial-Time Hierarchy
- Techniques to reduce /4-parity-phase circuits, motivated by the ZX calculus
- Tensor network rewriting strategies for satisfiability and counting
- The Complexity of Enumeration and Reliability Problems
- The complexity of tensor calculus
- The structure of sum-over-paths, its consequences, and completeness for Clifford
- The ZX-calculus is complete for stabilizer quantum mechanics
- Theory and Applications of Satisfiability Testing
- Two complete axiomatisations of pure-state qubit quantum computing
This page was built for publication: A graphical \#SAT algorithm for formulae with small clause density
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6934065)
