Publications
Preprints
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
Information for reviewers
Review process
How to peer review
Peer review policy
Register Dashboard
Search

Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen

Register Dashboard
Search
9
views
18
references
 Top references
cited by
0
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      3,028
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Algorithms and Computation 

      An \(O(n^{\epsilon })\) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs

      other
      Author(s): ,
      Publication date (Online):
      Publisher: Springer Berlin Heidelberg

      Read this book at

      Publisher
      Buy book
      Bookmark
          There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references18

          • Record: found
          • Abstract: not found
          • Article: not found

          Relationships between nondeterministic and deterministic tape complexities

          Walter J. Savitch (1970)
          Article 0 comments Cited 114 times – based on 0 reviews     Review now
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Undirected connectivity in log-space

            Omer Reingold (2008)
            Article 0 comments Cited 46 times – based on 0 reviews     Review now
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Symmetric space-bounded computation

              Harry R. Lewis, Christos Papadimitriou (1982)
              Article 0 comments Cited 13 times – based on 0 reviews     Review now
                Bookmark
                All references

                Author and book information

                Book Chapter
                Publication date (Print): 2015
                Publication date (Online): November 27 2015
                Pages: 614-624
                DOI: 10.1007/978-3-662-48971-0_52
                SO-VID: e6996bf1-274b-483d-909f-c284224986f5
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content3,028

                See all similar