Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
26
click to vote
SIAMCOMP
2008
favorite
Email
discuss
report
75
views
more
SIAMCOMP 2008
»
Splitting NP-Complete Sets
13 years 11 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
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)
Researcher Info
SIAMCOMP 1998 Study Group
Computer Vision