Abstract
In this paper we prove that, in the context of weak machines over R, there are no sparse NP-hard sets. © 2001 Society for Industrial and Applied Mathematics.
| Original language | English |
|---|---|
| Pages (from-to) | 193-198 |
| Journal | SIAM Journal on Computing |
| Volume | 31 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 2001 |
Research Keywords
- Real number computations
- Structural complexity
Publisher's Copyright Statement
- COPYRIGHT TERMS OF DEPOSITED FINAL PUBLISHED VERSION FILE: © 2001 Society for Industrial and Applied Mathematics.
Fingerprint
Dive into the research topics of 'There are no sparse NPW-hard sets'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver