ACM SIGACT News
Sharp threshold and scaling window for the integer partitioning problem
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On threshold properties of k-SAT: an additive viewpoint
European Journal of Combinatorics - Special issue on Eurocomb'03 - graphs and combinatorial structures
Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Solving medium-density subset sum problems in expected polynomial time
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |