Improved inapproximability results for counting independent sets in the hard-core model (Q2877770): Difference between revisions

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 5940184
@@ Property / title @@
+Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.68110
@@ Property / zbMATH Open document ID: 1343.68110 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-642-22935-0_48
@@ Property / DOI: 10.1007/978-3-642-22935-0_48 / rank @@
+Normal rank
@@ Property / published in @@
+Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
+Normal rank
@@ Property / publication date @@
+August 2011Timestamp +2011-08-17T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2011-08-17T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 17 August 2011 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W20
@@ Property / Mathematics Subject Classification ID: 68W20 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+5940184
@@ Property / zbMATH DE Number: 5940184 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2130723959
@@ Property / OpenAlex ID: W2130723959 / rank @@
+Normal rank
@@ Property / cites work @@
+Percolation and the hard-core lattice gas model
@@ Property / cites work: Percolation and the hard-core lattice gas model / rank @@
+Normal rank
@@ Property / cites work @@
+On Counting Independent Sets in Sparse Graphs
@@ Property / cites work: On Counting Independent Sets in Sparse Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
+Normal rank
@@ Property / cites work @@
+Random generation of combinatorial structures from a uniform distribution
+Normal rank
@@ Property / cites work @@
+Loss networks
@@ Property / cites work: Loss networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549475
@@ Property / cites work: Q3549475 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4344223
@@ Property / cites work: Q4344223 / rank @@
+Normal rank
@@ Property / cites work @@
+On the hardness of sampling independent sets beyond the tree threshold
+Normal rank
@@ Property / cites work @@
+Adaptive simulated annealing: A near-optimal connection between sampling and counting
+Normal rank
@@ Property / cites work @@
+Cylindrical algebraic decomposition using validated numerics
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ Property / cites work @@
+Counting independent sets up to the tree threshold
+Normal rank
@@ Property / cites work @@
+Q5792485
@@ Property / cites work: Q5792485 / rank @@
+Normal rank

Latest revision as of 23:05, 8 July 2024

scientific article; zbMATH DE number 5940184

Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model

Language	Label	Description	Also known as
English	Improved inapproximability results for counting independent sets in the hard-core model	scientific article; zbMATH DE number 5940184	Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model