Splitting NP-Complete Sets

15 years 2 months ago

Download www.cs.iastate.edu

We show that a set is m-autoreducible if and only if it is m-mitotic. This solves a long standing open question in a surprising way. As a consequence of this unconditional result and recent work by Gla

Christian Glaßer, Aduri Pavan, Alan L. Selma

Real-time Traffic

Glaßer Et | Open Question | SIAMCOMP 2008 | Surprising Way |

claim paper

» InclusionExclusion Branching for Partial Dominating Set and Set Splitting

» On the Structure of Bounded Queries to Arbitrary NP Sets

» SaM A Split and Merge Algorithm for Fuzzy Frequent Item Set Mining

» Operator Splittings Bregman Methods and Frame Shrinkage in Image Processing

» Consistency of SequenceBased Gene Clusters

» Final exam scheduler FES

» Table design in dynamic programming

» An adaptive memory algorithm for the split delivery vehicle routing problem

» Set Bounds and Split Set Domain Propagation Using ROBDDs

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2008
Where	SIAMCOMP
Authors	Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang

Comments (0)

Sciweavers

Splitting NP-Complete Sets

Glaßer Et | Open Question | SIAMCOMP 2008 | Surprising Way |

Explore & Download

Productivity Tools

Sciweavers