Reachability is in DynFO (Q3449473): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 00:11, 11 July 2024

scientific article

Language	Label	Description	Also known as
English	Reachability is in DynFO	scientific article

Statements

scholarly article

0 references

Reachability is in DynFO (English)

0 references

0 references

Raghav Kulkarni

0 references

Anish Mukherjee

0 references

Thomas Schwentick

0 references

0 references

Automata, Languages, and Programming

0 references

publication date

4 November 2015

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-662-47666-6_13

0 references

Isolation, matching, and counting uniform and nonuniform upper bounds

0 references

Dynamic Complexity of Directed Reachability and Other Problems

0 references

Incremental and decremental evaluation of transitive closure by first- order queries

0 references

Arity bounds in first-order incremental evaluation and definition of polynomial time database queries

0 references

Dynamic matrix rank

0 references

The dynamic complexity of transitive closure is in DynTC\(^{0}\).

0 references

0 references

Matching is as easy as matrix inversion

0 references

Dyn-FO: A parallel, dynamic complexity class

0 references

On Dynamic Algorithms for Algebraic Problems

0 references

0 references

On the quantifier-free dynamic complexity of reachability

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-662-47666-6_13

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3449473

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3449473&oldid=36210914"