<technical report>
The Lexicographically First Topologicai Order Problem is NLOG-Complete
Creator | |
---|---|
Language | |
Publisher | |
Date | |
Source Title | |
Vol | |
Publication Type | |
Access Rights | |
Related DOI | |
Related URI | |
Relation | |
Abstract | We show that the lexicogrsphically first topological order problem is NLOG - complete. The algorithm presented here uses the result that NLOG is closed under complementation. |
Hide fulltext details.
File | FileType | Size | Views | Description |
---|---|---|---|---|
rifis-tr-8 | 850 KB | 457 |
Details
Record ID | |
---|---|
Peer-Reviewed | |
Subject Terms | |
Notes | |
Type | |
Created Date | 2009.04.22 |
Modified Date | 2017.01.20 |