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
3
views
14
references
 Top references
cited by
3
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      238
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Automata, Languages, and Programming 

      Reachability is in DynFO

      other

      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 references14

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

          Matching is as easy as matrix inversion

          Ketan Mulmuley, Umesh Vazirani, Vijay V Vazirani (1987)
          Article 0 comments Cited 66 times – based on 0 reviews     Review now
            Bookmark
            • Record: found
            • Abstract: not found
            • Book: not found

            Descriptive Complexity

            Neil Immerman (1999)
            Book 0 comments Cited 39 times – based on 0 reviews
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Dyn-FO: A Parallel, Dynamic Complexity Class

              Neil Immerman, Sushant Patnaik (1997)
              Article 0 comments Cited 22 times – based on 0 reviews     Review now
                Bookmark
                All references

                Author and book information

                Book Chapter
                Publication date (Print): 2015
                Publication date (Online): June 20 2015
                Pages: 159-170
                DOI: 10.1007/978-3-662-47666-6_13
                SO-VID: 13cc1701-b133-4e00-82a4-e61174219342
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content238

                See all similar

                Cited by3

                See all cited by