| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10331980 | Information Processing Letters | 2005 | 6 Pages |
Abstract
We also explore the tractability of linear and regular predicates. In particular, we show that, unless RP=NP, there is no polynomial-time algorithm to detect possibly:B for linear and regular predicates B.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Sujatha Kashyap, Vijay K. Garg,