Complexity and structure
Nearly optimal hierarchies for network and formula size
Acta Informatica
Structural complexity 1
Parallel computation with threshold functions
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Structural complexity 2
PP is as hard as the polynomial-time hierarchy
SIAM Journal on Computing
A note on polynomial-size circuits with low resource-bounded Kolmogorov complexity
Mathematical Systems Theory
Nondeterministic NC1 computation
Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
Separating Nondeterministic Time Complexity Classes
Journal of the ACM (JACM)
The complexity theory companion
The complexity theory companion
Introduction to Circuit Complexity: A Uniform Approach
Introduction to Circuit Complexity: A Uniform Approach
Theory of Semi-Feasible Algorithms
Theory of Semi-Feasible Algorithms
Characterizations of Logarithmic Advice Complexity Classes
Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software, Architecture - Information Processing '92, Volume 1 - Volume I
Nonuniform Lower Bounds for Exponential Time Classes
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
We prove that various geometric covering problems related to the Traveling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This includes the Group-Traveling Salesman Problem (TSP with Neighborhoods) in ...