Computing Solution Space Properties of Combinatorial Optimization Problems Via Generic Tensor Networks (Q6098526): Difference between revisions

Latest revision as of 18:25, 30 December 2024

scientific article; zbMATH DE number 7695782

Language	Label	Description	Also known as
English	Computing Solution Space Properties of Combinatorial Optimization Problems Via Generic Tensor Networks	scientific article; zbMATH DE number 7695782

Statements

instance of

scholarly article

0 references

title

Computing Solution Space Properties of Combinatorial Optimization Problems Via Generic Tensor Networks (English)

0 references

0 references

0 references

0 references

0 references

0 references

SIAM Journal on Scientific Computing

0 references

publication date

14 June 2023

0 references

full work available at URL

https://arxiv.org/abs/2205.03718

0 references

zbMATH Keywords

generic tensor network

0 references

solution space property

0 references

independent set

0 references

combinatorial optimization

0 references

MaRDI profile type

Publication

0 references

cites work

Introduction to Domination Polynomial of a Graph

0 references

Anderson localization makes adiabatic quantum optimization fail

0 references

Julia: A Fresh Approach to Numerical Computing

0 references

Tensor network contractions for \#SAT

0 references

Q5483032

0 references

On the independence complex of square grids

0 references

Algorithm 457: finding all cliques of an undirected graph

0 references

The monadic second-order logic of graphs. I: Recognizable sets of finite graphs

0 references

Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time

0 references

The overlap gap property and approximate message passing algorithms for $p$-spin models

0 references

Limits of local algorithms over sparse random graphs

0 references

The Rectilinear Steiner Tree Problem is $NP$-Complete

0 references

On independent sets and bicliques in graphs

0 references

Q4917542

0 references

Computing the Independence Polynomial: from the Tree Threshold down to the Roots

0 references

On generating all maximal independent sets

0 references

Statistical Theory of Equations of State and Phase Transitions. II. Lattice Gas and Ising Model

0 references

On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph

0 references

Q5251430

0 references

Simulating Quantum Computation by Contracting Tensor Networks

0 references

Q3090774

0 references

A practical introduction to tensor networks: Matrix product states and projected entangled pair states

0 references

Tensor-Train Decomposition

0 references

Local algorithms for independent sets are half-optimal

0 references

Fast multiplication of large numbers

0 references

The complexity of tropical matrix factorization

0 references

A review on algorithms for maximum clique problems

0 references

Statistical Theory of Equations of State and Phase Transitions. I. Theory of Condensation

0 references

Identifiers

zbMATH Open document ID

1527.90189

0 references

arXiv ID

2205.03718

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6098526

@@ Property / DOI @@
-.1137/22m1501787
@@ Property / DOI: 10.1137/22m1501787 / rank @@
-Normal rank
@@ Property / OpenAlex ID @@
+W4380434217
@@ Property / OpenAlex ID: W4380434217 / rank @@
+Normal rank
@@ Property / cites work @@
+Introduction to Domination Polynomial of a Graph
@@ Property / cites work: Introduction to Domination Polynomial of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Anderson localization makes adiabatic quantum optimization fail
+Normal rank
@@ Property / cites work @@
+Julia: A Fresh Approach to Numerical Computing
@@ Property / cites work: Julia: A Fresh Approach to Numerical Computing / rank @@
+Normal rank
@@ Property / cites work @@
+Tensor network contractions for \#SAT
@@ Property / cites work: Tensor network contractions for \#SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Q5483032
@@ Property / cites work: Q5483032 / rank @@
+Normal rank
@@ Property / cites work @@
+On the independence complex of square grids
@@ Property / cites work: On the independence complex of square grids / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm 457: finding all cliques of an undirected graph
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
+Normal rank
@@ Property / cites work @@
+The overlap gap property and approximate message passing algorithms for \(p\)-spin models
+Normal rank
@@ Property / cites work @@
+Limits of local algorithms over sparse random graphs
+Normal rank
@@ Property / cites work @@
+The Rectilinear Steiner Tree Problem is $NP$-Complete
+Normal rank
@@ Property / cites work @@
+On independent sets and bicliques in graphs
@@ Property / cites work: On independent sets and bicliques in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4917542
@@ Property / cites work: Q4917542 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the Independence Polynomial: from the Tree Threshold down to the Roots
+Normal rank
@@ Property / cites work @@
+On generating all maximal independent sets
@@ Property / cites work: On generating all maximal independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Statistical Theory of Equations of State and Phase Transitions. II. Lattice Gas and Ising Model
+Normal rank
@@ Property / cites work @@
+On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph
+Normal rank
@@ Property / cites work @@
+Q5251430
@@ Property / cites work: Q5251430 / rank @@
+Normal rank
@@ Property / cites work @@
+Simulating Quantum Computation by Contracting Tensor Networks
+Normal rank
@@ Property / cites work @@
+Q3090774
@@ Property / cites work: Q3090774 / rank @@
+Normal rank
@@ Property / cites work @@
+A practical introduction to tensor networks: Matrix product states and projected entangled pair states
+Normal rank
@@ Property / cites work @@
+Tensor-Train Decomposition
@@ Property / cites work: Tensor-Train Decomposition / rank @@
+Normal rank
@@ Property / cites work @@
+Local algorithms for independent sets are half-optimal
+Normal rank
@@ Property / cites work @@
+Fast multiplication of large numbers
@@ Property / cites work: Fast multiplication of large numbers / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of tropical matrix factorization
@@ Property / cites work: The complexity of tropical matrix factorization / rank @@
+Normal rank
@@ Property / cites work @@
+A review on algorithms for maximum clique problems
+Normal rank
@@ Property / cites work @@
+Statistical Theory of Equations of State and Phase Transitions. I. Theory of Condensation
+Normal rank
@@ Property / DOI @@
+.1137/22M1501787
@@ Property / DOI: 10.1137/22M1501787 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:6098526