Amanote Research
Register
Sign In
Hardness Amplification Within NP Against Deterministic Algorithms
doi 10.1109/ccc.2008.17
Full Text
Open PDF
Abstract
Available in
full text
Date
June 1, 2008
Authors
Parikshit Gopalan
Venkatesan Guruswami
Publisher
IEEE
Related search
Trusses, NP-Completeness, and Genetic Algorithms
Deterministic Algorithms for Submodular Maximization Problems
Internally Deterministic Parallel Algorithms Can Be Fast
ACM SIGPLAN Notices
Computer Science
Deterministic Algorithms for the Lovász Local Lemma
SIAM Journal on Computing
Mathematics
Computer Science
Exact Algorithms for NP-Hard Problems: A Survey
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Primal-Dual Algorithms for Deterministic Inventory Problems
Mathematics of Operations Research
Management Science
Computer Science Applications
Operations Research
Mathematics
Hardness vs. Randomness Within Alternating Time
Deterministic Local Algorithms, Unique Identifiers, and Fractional Graph Colouring
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Approximation Algorithms and Hardness of Thek-Route Cut Problem
ACM Transactions on Algorithms
Mathematics
