Published August 28, 1998
| Version v1
Journal article
Open
A Note on Linear-Nondeterminism, Linear-Sized, Karp-Lipton Advice for the P-Selective Sets
Authors/Creators
- 1. Department of Computer Science, University of Rochester, Rochester, NY, United States of America
- 2. Department of Computer Science, University of Rochester, Rochester, NY 14627, United States of America
Description
Hemaspaandra and Torenvliet showed that each P-selective set can be accepted by a polynomial-time nondeterministic machine using linear advice and quasi-linear nondeterminism. We show that each P-selective set can be accepted by a polynomial-time nondeterministic machine using linear advice and linear nondeterminism.
Files
jucs_article_27507.pdf
Files
(161.8 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:8f4697532b3221e6c18003dea1b378c8
|
161.8 kB | Preview Download |