scientific article
From MaRDI portal
Publication:2904751
DOI10.4230/LIPICS.STACS.2012.78zbMath1245.68244arXiv1107.2001MaRDI QIDQ2904751
Publication date: 23 August 2012
Full work available at URL: https://arxiv.org/abs/1107.2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (3)
The relative exponential time complexity of approximate counting satisfying assignments ⋮ The Relative Exponential Time Complexity of Approximate Counting Satisfying Assignments ⋮ Exploiting independent subformulas: a faster approximation scheme for \(\# k\)-SAT
This page was built for publication:
