Abstract
These results improve upon previous results of many authors. The third result resolves in the affirmative a conjecture of Papadimltnou and Yannakakis that the LOG PATH problem is m P. We can show that it is even in NC.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 844-856 |
| Number of pages | 13 |
| Journal | Journal of the ACM (JACM) |
| Volume | 42 |
| Issue number | 4 |
| DOIs | |
| State | Published - Jul 1 1995 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Software
- Control and Systems Engineering
- Information Systems
- Hardware and Architecture
- Artificial Intelligence
Keywords
- Derandornization
- perfect hashing
- subgraph isomorphism
- tree-width