Tensor network rewriting strategies for satisfiability and counting

DOI10.4204/eptcs.340.3MaRDI QIDQ6645576

Aleks Kissinger, Konstantinos Meichanetzidis, Niel de Beaudrap

Publication date: 28 November 2024

Mathematics Subject Classification ID

Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx)

Cites Work

• Unnamed Item
• Unnamed Item
• The complexity of tensor calculus
• The Complexity of Enumeration and Reliability Problems
• A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms
• Interacting quantum observables: categorical algebra and diagrammatics
• The complexity of theorem-proving procedures

This page was built for publication: Tensor network rewriting strategies for satisfiability and counting