The lexicographically first topological order problem is NLOG-complete (Q582104): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68Q25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68P10 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03D15 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 4130022 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
computational complexity | |||
Property / zbMATH Keywords: computational complexity / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
topological sort | |||
Property / zbMATH Keywords: topological sort / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
NLOG-complete | |||
Property / zbMATH Keywords: NLOG-complete / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0020-0190(89)90189-0 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2050015733 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallelism and the maximal path problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A taxonomy of problems with fast parallel algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel Matrix and Graph Algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nondeterministic Space is Closed under Complementation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5585020 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3783600 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A parallelizable lexicographically first maximal edge-induced subgraph problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3795248 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Depth-first search is inherently sequential / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3815544 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4010349 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 12:12, 20 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The lexicographically first topological order problem is NLOG-complete |
scientific article |
Statements
The lexicographically first topological order problem is NLOG-complete (English)
0 references
1989
0 references
computational complexity
0 references
topological sort
0 references
NLOG-complete
0 references