1998 search results - page 75 / 400 » Complexity of the Cover Polynomial |
ESA
2003
Springer
14 years 3 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
AIPS
2008
14 years 10 days ago
2008
We present a complex scheduling problem where we want to plan meetings between customers and exhibitors at a trade event. One cause of the complexity of the problem is the general...
ER
2007
Springer
14 years 4 months ago
2007
Springer
The major purpose of the design of distributed databases is to improve system performance and to increase system reliability. Fragmentation and allocation play important roles in t...
ER
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We investigate the computational complexity of reasoning over temporal extensions of conceptual data models. The temporal conceptual models we analyse include the standar...
ECCC
2010
13 years 10 months ago
2010
The IP theorem, which asserts that IP = PSPACE (Lund et. al., and Shamir, in J. ACM 39(4)), is one of the major achievements of complexity theory. The known proofs of the theorem ...