FPTAS for Weighted Fibonacci Gates and Its Applications
From MaRDI portal
Publication:5167792
DOI10.1007/978-3-662-43948-7_65zbMath1412.68087arXiv1402.4370OpenAlexW1781407537MaRDI QIDQ5167792
Chihao Zhang, Meng-Hui Wang, Pinyan Lu
Publication date: 1 July 2014
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.4370
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Related Items (4)
Zero-freeness and approximation of real Boolean Holant problems ⋮ Zeros and approximations of holant polynomials on the complex plane ⋮ On the Complexity of Holant Problems ⋮ Counting hypergraph matchings up to uniqueness threshold
This page was built for publication: FPTAS for Weighted Fibonacci Gates and Its Applications
