scientific article; zbMATH DE number 6096665
From MaRDI portal
Publication:3166129
zbMATH Open1268.81031MaRDI QIDQ3166129FDOQ3166129
Author name not available (Why is that?)
Publication date: 21 October 2012
Title of this publication is not available (Why is that?)
Quantum algorithms and complexity in the theory of computing (68Q12) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)
Cited In (3)
Recommendations
- Tensor decomposition and approximation schemes for constraint satisfaction problems π π
- An efficient algorithm for the 3-satisfiability problem π π
- Tensor network contractions for \#SAT π π
- Exactly solvable and unsolvable shortest network problems in 3D-space π π
- Three-dimensional structured networks for matrix equation solving π π
- TeNeS: tensor network solver for quantum lattice systems π π
- Computing Solution Space Properties of Combinatorial Optimization Problems Via Generic Tensor Networks π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
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)