Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the Quantifier-Free Dynamic Complexity of Reachability

From MaRDI portal
Publication:2849966
Jump to:navigation, search

DOI10.1007/978-3-642-40313-2_73zbMath1371.68063arXiv1306.3056OpenAlexW2570673476MaRDI QIDQ2849966

Thomas Schwentick, Thomas Zeume

Publication date: 20 September 2013

Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.3056



Mathematics Subject Classification ID

Database theory (68P15)


Related Items (2)

Dynamic conjunctive queries ⋮ On the quantifier-free dynamic complexity of reachability






This page was built for publication: On the Quantifier-Free Dynamic Complexity of Reachability

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2849966&oldid=15780419"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 19:22.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki