17 search results - page 1 / 4 » Autoreducibility of NP-Complete Sets |
MFCS
2005
Springer
13 years 11 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...
FSTTCS
2007
Springer
14 years 12 days ago
2007
Springer
We study the question of the existence of non-mitotic sets in NP. We show under various hypotheses that • 1-tt-mitoticity and m-mitoticity differ on NP. • 1-tt-reducibility a...
RECOMB
2010
Springer
13 years 4 months ago
2010
Springer
In comparative genomics, various combinatorial models can be used to specify gene clusters — groups of genes that are co-located in a set of genomes. Several approaches have been...
COCO
1989
Springer
13 years 10 months ago
1989
Springer
Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...
ADHOCNOW
2010
Springer
13 years 4 months ago
2010
Springer
A set of sensors establishes barrier coverage of a given line segment if every point of the segment is within the sensing range of a sensor. Given a line segment I, n mobile sensor...