SIGACT news complexity theory comun 37
ACM SIGACT News
SIGACT news complexity theory column 38
ACM SIGACT News
On the complexity of approximating the VC dimension
Journal of Computer and System Sciences - Complexity 2001
Hardness of Approximating Minimization Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Beyond NP: the work and legacy of Larry Stockmeyer
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4]
Theoretical Computer Science - Algorithmic applications in management
Bounded fixed-parameter tractability and log2n nondeterministic bits
Journal of Computer and System Sciences
| Hi-index | 0.00 |