Sciweavers

7 search results - page 1 / 2
» coco 1995
Sort
View
COCO
1995
Springer
115views Algorithms» more  COCO 1995»
13 years 8 months ago
On Approximation Algorithms for Hierarchical MAX-SAT
Sameet Agarwal, Anne Condon
COCO
1995
Springer
75views Algorithms» more  COCO 1995»
13 years 8 months ago
On Finding the Number of Graph Automorphisms
Richard Chang, William I. Gasarch, Jacobo Tor&aacu...
COCO
1995
Springer
113views Algorithms» more  COCO 1995»
13 years 8 months ago
On the Structure of Low Sets
Over a decade ago, Schoning introduced the concept of lowness into structural complexity theory. Since then a large body of results has been obtained classifying various complexit...
Johannes Köbler
COCO
1995
Springer
134views Algorithms» more  COCO 1995»
13 years 8 months ago
Towards Average-Case Complexity Analysis of NP Optimization Problems
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
Rainer Schuler, Osamu Watanabe