The computational complexity of simultaneous diophantine approximation problems
SIAM Journal on Computing
Almost all primes can be quickly certified
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Proceedings of CRYPTO 84 on Advances in cryptology
Does co-NP have short interactive proofs?
Information Processing Letters
Recognizing planar perfect graphs
Journal of the ACM (JACM)
A hierarchy of polynomial time lattice basis reduction algorithms
Theoretical Computer Science
On optimal interpolation triangle incidences
SIAM Journal on Scientific and Statistical Computing
An O(n2log n) time algorithm for the MinMax angle triangulation
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
On the complexity of testing for odd holes and induced odd paths
Discrete Mathematics
Journal of the ACM (JACM)
Approximating the minimum weight triangulation
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A quadratic time algorithm for the minmax length triangulation
SIAM Journal on Computing
Homeomorphism of 2-Complexes is Graph Isomorphism Complete
SIAM Journal on Computing
Generating hard instances of lattice problems (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Approximation algorithms for geometric problems
Approximation algorithms for NP-hard problems
The hardness of approximate optima in lattices, codes, and systems of linear equations
Journal of Computer and System Sciences - Special issue: papers from the 32nd and 34th annual symposia on foundations of computer science, Oct. 2–4, 1991 and Nov. 3–5, 1993
A public-key cryptosystem with worst-case/average-case equivalence
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
On the limits of non-approximability of lattice problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A relation of primal-dual lattices and the complexity of shortest lattice vector problem
Theoretical Computer Science - Special issue In Memoriam of Ronald V. Book
Quasi-greedy triangulations approximating the minimum weight triangulation
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Primality testing using elliptic curves
Journal of the ACM (JACM)
Approximating shortest lattice vectors is not harder than approximating closet lattice vectors
Information Processing Letters
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
A note on the non-NP-hardness of approximate lattice problems under general Cook reductions
Information Processing Letters
A sieve algorithm for the shortest lattice vector problem
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximating minimum unsatisfiability of linear equations
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant
SIAM Journal on Computing
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
New lattice based cryptographic constructions
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Some Recent Progress on the Complexity of Lattice Problems
COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
An Improved Worst-Case to Average-Case Connection for Lattice Problems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Approximating-CVP to within Almost-Polynomial Factors is NP-Hard
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Hardness of Approximating the Minimum Distance of a Linear Code
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
The Inapproximability of Lattice and Coding Problems with Preprocessing
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
The Complexity of the Covering Radius Problem on Lattices and Codes
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
On the Hardness of Graph Isomorphism
SIAM Journal on Computing
Hardness of Approximating the Shortest Vector Problem in Lattices
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Worst-Case to Average-Case Reductions Based on Gaussian Measures
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Almost Perfect Lattices, the Covering Radius Problem, and Applications to Ajtai's Connection Factor
SIAM Journal on Computing
Combinatorica
Even-hole-free graphs part II: Recognition algorithm
Journal of Graph Theory
Journal of Graph Theory
The intractability of computing the minimum distance of a code
IEEE Transactions on Information Theory
Maximum-likelihood decoding of Reed-Solomon codes is NP-hard
IEEE Transactions on Information Theory
Parameterized Complexity
Minimum weight triangulation is NP-hard
Proceedings of the twenty-second annual symposium on Computational geometry
Minimum-weight triangulation is NP-hard
Journal of the ACM (JACM)
Algorithms and theory of computation handbook
A faster algorithm to recognize even-hole-free graphs
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Finding consistent categorial grammars of bounded value: a parameterized approach
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Theoretical Computer Science
A Metaheuristic Approach to the Graceful Labeling Problem
International Journal of Applied Metaheuristic Computing
| Hi-index | 0.00 |
This is the 24th edition of a column that covers new developments in the theory of NP-completeness. The presentation is modeled on that which M. R. Garey and I used in our book “Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., New York, 1979, hereinafter referred to as “[G&J].” Previous columns, the first 23 of which appeared in J. Algorithms, will be referred to by a combination of their sequence number and year of appearance, e.g. “[Col 1, 1981].” This edition of the column describes the history and purpose of the column and the status of the open problems from [G&J] and previous columns.