Journal Article10.1016/0020-0190(96)00031-2
On approximation algorithms for the minimum satisfiability problem
M. V. Marathe,S. S. Ravi +1 more
70
TL;DR: An approximation-preserving reduction from MINSAT to the minimum vertex cover (MINVC) problem is presented, and it is observed thatMINSAT remains NP-complete even when restricted to planar instances.
read more
About: This article is published in Information Processing Letters. The article was published on 08 Apr 1996. The article focuses on the topics: Approximation algorithm & Vertex cover.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz.
TL;DR: The essence of this extension, the quantum alternating operator ansatz, is the consideration of general parameterized families of unitaries rather than only those corresponding to the time evolution under a fixed local Hamiltonian for a time specified by the parameter.
•Proceedings Article
Succinct non-interactive zero knowledge for a von Neumann architecture
Eli Ben-Sasson,Alessandro Chiesa,Eran Tromer,Madars Virza +3 more
- 20 Aug 2014
TL;DR: A system that provides succinct noninteractive zero-knowledge proofs (zk-SNARKs) for program executions on a von Neumann RISC architecture and is the first to be universal: it does not need to know the program, but only a bound on its running time.
•Journal Article
Parametrizing Above Guaranteed Values: MaxSat and MaxCut
Meena Mahajan,Venkatesh Raman +1 more
TL;DR: This paper investigates the parameterized complexity of the problems MaxSat and MaxCut using the framework developed by Downey and Fellows, and shows that these problems remain fixed-parameter tractable even under this parameterization, and gives an algorithm for finding a cut of size at leastk.
280
Parameterizing above Guaranteed Values
Meena Mahajan,Venkatesh Raman +1 more
TL;DR: In this article, the authors investigated the parameterized complexity of MaxSat and MaxCut problems and showed that these problems remain fixed-parameter tractable even under this parameterization.
280
From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
TL;DR: The quantum alternating operator ansatz (QOANSatz) as discussed by the authors is a generalization of the original quantum approximate optimization algorithm, which alternates between applying a cost function based Hamiltonian and a mixing Hamiltonian.
233
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
•Book
Approximation Algorithms for NP-Hard Problems
Dorit S. Hochba
- 01 Jan 1996
TL;DR: This book reviews the design techniques for approximation algorithms and the developments in this area since its inception about three decades ago and the "closeness" to optimum that is achievable in polynomial time.
3.5K
Approximation algorithms for combinatorial problems
TL;DR: For the problem of finding the maximum clique in a graph, no algorithm has been found for which the ratio does not grow at least as fast as n^@e, where n is the problem size and @e>0 depends on the algorithm.
2.5K