scientific article; zbMATH DE number 6096665
From MaRDI portal
Publication:3166129
zbMATH Open1268.81031MaRDI QIDQ3166129FDOQ3166129
Authors:
Publication date: 21 October 2012
Title of this publication is not available (Why is that?)
Recommendations
- Tensor network contractions for \#SAT
- Computing Solution Space Properties of Combinatorial Optimization Problems Via Generic Tensor Networks
- Tensor decomposition and approximation schemes for constraint satisfaction problems
- Tensor network complexity of multilinear maps
- Tensor network complexity of multilinear maps
- TeNeS: tensor network solver for quantum lattice systems
- Three-dimensional structured networks for matrix equation solving
- A numerical approach to 3-SAT
- An efficient algorithm for the 3-satisfiability problem
- Exactly solvable and unsolvable shortest network problems in 3D-space
Quantum algorithms and complexity in the theory of computing (68Q12) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Cited In (5)
- Computing Solution Space Properties of Combinatorial Optimization Problems Via Generic Tensor Networks
- Tensor network contractions for \#SAT
- Picturing Counting Reductions with the ZH-Calculus
- Tensor network rewriting strategies for satisfiability and counting
- Quantum computation and the evaluation of tensor networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3166129)
