The following pages link to (Q3783600):
Displaying 4 items.
- The lexicographically first topological order problem is NLOG-complete (Q582104) (← links)
- A parallelizable lexicographically first maximal edge-induced subgraph problem (Q1108808) (← links)
- The complexity of circuit value and network stability (Q1190989) (← links)
- Efficient parallel algorithms for parameterized problems (Q2319897) (← links)