The Relative Exponential Time Complexity of Approximate Counting Satisfying Assignments
Crossref DOI link: https://doi.org/10.1007/s00453-016-0134-y
Published Online: 2016-02-16
Published Print: 2016-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Traxler, Patrick
Funding for this research was provided by:
Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung (200021-118001/1)
Text and Data Mining valid from 2016-02-16