An O(n^{\varepsilon}) space and polynomial time algorithm for reachability in directed layered planar graphs

Diptarka Chakraborty, R. T. (2018). An O(n^{\varepsilon}) space and polynomial time algorithm for reachability in directed layered planar graphs. ACM.

Type

Unclassified

Intellectual base

Unclassified

Year

2018

DOI

10.1145/3154857

Link

https://doi.org/10.1145/3154857

Cited by

1 citation across 1 artifact.

Domain-specific

• SC (complexity)
  • The same machine must meet both bounds, so SC is not definitionally P intersect PolyL, exponent conventions are fixed constants and several containments remain open.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:3294fc01a0af · see in the full table