Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

COCO
2001
Springer

favoriteEmaildiscussreport

102views Algorithms» more COCO 2001»

Separation of NP-Completeness Notions

13 years 9 months ago

Separation of NP-Completeness Notions

Download www.cse.buffalo.edu

We use hypotheses of structural complexity theory to separate various NP-completeness notions. In particular, we introduce an hypothesis from which we describe a set in NP that is ≤P T -complete but not ≤P tt -complete. We provide fairly thorough analyses of the hypotheses that we introduce.

Aduri Pavan, Alan L. Selman

Real-time Traffic

Algorithms | COCO 2001 | Hypotheses | Structural Complexity Theory | Various Np-completeness Notions |

claim paper

Related Content

» BiImmunity Separates Strong NPCompleteness Notions

» Separations of Nonmonotonic Randomness Notions

» Collapsing and Separating Completeness Notions under AverageCase and WorstCase Hypotheses

» Relations Among Notions of Security for PublicKey Encryption Schemes

» Authenticated Encryption Relations among Notions and Analysis of the Generic Composition P...

» ImageNotion Methodology Tool Support and Evaluation

» Comparing Two Notions of Simulatability

» Swingup control for nlink planar robot with single passive joint using the notion of virtu...

» A Notion of Glue Expressiveness for ComponentBased Systems

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	COCO
Authors	Aduri Pavan, Alan L. Selman

Comments (0)