MFCS
2005
Springer
14 years 7 months ago
2005
Springer
We prove that every disjoint NP-pair is polynomial-time, many-one equivalent to the canonical disjoint NP-pair of some propositional proof system. Therefore, the degree structure ...
MFCS
2005
Springer
14 years 7 months ago
2005
Springer
We show the following results regarding complete sets. • NP-complete sets and PSPACE-complete sets are many-one autoreducible. • Complete sets of any level of PH, MODPH, or th...
MFCS
2005
Springer
14 years 7 months ago
2005
Springer
We consider the problem of job scheduling on a variable voltage processor with d discrete voltage/speed levels. We give an algorithm which constructs a minimum energy schedule for ...
MFCS
2005
Springer
14 years 7 months ago
2005
Springer
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...
MFCS
2005
Springer
14 years 7 months ago
2005
Springer
MFCS
2005
Springer
14 years 7 months ago
2005
Springer
We study online interval coloring problems with bandwidth. We are interested in some variants motivated by bin packing problems. Specifically we consider open-end coloring, cardin...
MFCS
2005
Springer
14 years 7 months ago
2005
Springer
MFCS
2005
Springer
14 years 7 months ago
2005
Springer
We propose a method to approximate a polygonal object by a deformable smooth surface, namely the t-skin defined by Edelsbrunner [5]
MFCS
2005
Springer
14 years 7 months ago
2005
Springer
Abstract. Given a distance matrix M that specifies the pairwise evolutionary distances between n species, the phylogenetic tree reconstruction problem asks for an edge-weighted ph...
MFCS
2005
Springer
14 years 7 months ago
2005
Springer
