1998 search results - page 325 / 400 » Complexity of the Cover Polynomial |
100
click to vote
COCO
2004
Springer
15 years 6 months ago
2004
Springer
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...
105
click to vote
COCOON
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. The supply chain between manufacturers and retailers always includes transshipments through a network of locations. A major challenge in making demand meet supply has bee...
95
Voted
ESA
2004
Springer
15 years 6 months ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
129
Voted
ICSOC
2004
Springer
15 years 6 months ago
2004
Springer
The e-services paradigm promises to enable rich, flexible, and dynamic inter-operation of highly distributed, heterogeneous networkenabled services. Among the challenges, a funda...
115
click to vote
ISAAC
2004
Springer
15 years 6 months ago
2004
Springer
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...