The NP-completeness column: An ongoing guide
Journal of Algorithms
Average case complete problems
SIAM Journal on Computing
Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
On the inherent intractability of soft decision decoding of linear codes
on Coding theory and applications
Efficient checking of polynomials and proofs and the hardness of approximation problems
Efficient checking of polynomials and proofs and the hardness of approximation problems
On the complexity of approximating extremal determinants in matrices
Journal of Complexity
Fixed-parameter tractability and completeness II: on completeness for W[1]
Theoretical Computer Science
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
Probabilistic checking of proofs and hardness of approximation problems
Probabilistic checking of proofs and hardness of approximation problems
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 NP-hard problems
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Decoding of Reed Solomon codes beyond the error-correction bound
Journal of Complexity
Algebraic-Geometric Codes
Error-Correction Coding for Digital Communications
Error-Correction Coding for Digital Communications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximating the Number of Error Locations within a Constant Ratio is NP-complete
AAECC-10 Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Cryptocomplexity and NP-Completeness
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
On the decoding of algebraic-geometric codes
IEEE Transactions on Information Theory - Part 1
On the trellis structure of block codes
IEEE Transactions on Information Theory - Part 2
Lower bounds on trellis complexity of block codes
IEEE Transactions on Information Theory - Part 2
MDS array codes with independent parity symbols
IEEE Transactions on Information Theory
On the BCJR trellis for linear block codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory - Part 1
Linear-time encodable and decodable error-correcting codes
IEEE Transactions on Information Theory - Part 1
Generalized minimum-distance decoding of Euclidean-space codes and lattices
IEEE Transactions on Information Theory - Part 1
Proof of a conjecture of McEliece regarding the expansion index of the minimal trellis
IEEE Transactions on Information Theory - Part 1
On the intractability of permuting a block code to minimize trellis complexity
IEEE Transactions on Information Theory - Part 1
Good error-correcting codes based on very sparse matrices
IEEE Transactions on Information Theory
Asymptotically good codes have infinite trellis complexity
IEEE Transactions on Information Theory
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
Decoding algebraic-geometric codes beyond the error-correction bound
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Chinese remaindering with errors
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Maximum-likelihood decoding of Reed-Solomon codes is NP-hard
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The intractability of computing the Hamming distance
Theoretical Computer Science
Separating Models of Learning with Faulty Teachers
ALT '07 Proceedings of the 18th international conference on Algorithmic Learning Theory
Separating models of learning with faulty teachers
Theoretical Computer Science
Fast simplifications for Tarski formulas
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Integer SEC-DED codes for low power communications
Information Processing Letters
On the hardness of approximating stopping and trapping sets
IEEE Transactions on Information Theory
Problems of Information Transmission
On bounded distance decoding for general lattices
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Fast simplifications for Tarski formulas based on monomial inequalities
Journal of Symbolic Computation
FPT suspects and tough customers: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
On the minimum degree up to local complementation: bounds and complexity
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Designs, Codes and Cryptography
| Hi-index | 0.06 |