PCP characterizations of NP: towards a polynomially-small error-probability
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
SIGACT news complexity theory column 38
ACM SIGACT News
ASIAN '02 Proceedings of the7th Asian Computing Science Conference on Advances in Computing Science: Internet Computing and Modeling, Grid Computing, Peer-to-Peer Computing, and Cluster
Hardness of Approximating Minimization Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On the limit of branching rules for hard random unsatisfiable 3-SAT
Discrete Applied Mathematics - The renesse issue on satisfiability
Optimal length tree-like resolution refutations for 2SAT formulas
ACM Transactions on Computational Logic (TOCL)
On the hardness of approximating label-cover
Information Processing Letters
Frugal Routing on Wireless Ad-Hoc Networks
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Optimal Length Resolution Refutations of Difference Constraint Systems
Journal of Automated Reasoning
Minimum witnesses for unsatisfiable 2CNFs
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |