On approximation algorithms for hierarchical MAX-SAT
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- Random debaters and the hardness of approximating stochastic functionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Approximating clique is almost NP-completePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the Approximation of Maximum SatisfiabilityJournal of Algorithms, 1994
- The complexity of approximating PSPACE-complete problems for hierarchical specificationsPublished by Springer Nature ,1993
- The correlation between the complexities of the nonhierarchical and hierarchical versions of graph problemsJournal of Computer and System Sciences, 1992
- Proof verification and hardness of approximation problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Dispersers, deterministic amplification, and weak random sourcesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- How to recycle random bitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Exploiting hierarchy in VLSI designPublished by Springer Nature ,1986