Nondeterministic polynomial time versus nondeterministic logarithmic space: Time-space tradeoffs for satisfiability
| Authors |
|
|---|---|
| Publication date | 1997 |
| Book title | Proceedings of the 12th IEEE Conference on Computational Complexity |
| Pages (from-to) | 52-60 |
| Publisher | New York: IEEE |
| Organisations |
|
| Document type | Chapter |
| Permalink to this page | |