On the quantifier-free dynamic complexity of reachability (Q2514150)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	On the quantifier-free dynamic complexity of reachability	scientific article

Statements

scholarly article

0 references

On the quantifier-free dynamic complexity of reachability (English)

0 references

0 references

Thomas Schwentick

0 references

Information and Computation

0 references

publication date

30 January 2015

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ic.2014.09.011

0 references

Incremental recomputation in local languages.

0 references

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

0 references

SEPARATING AUXILIARY ARITY HIERARCHY OF FIRST-ORDER INCREMENTAL EVALUATION SYSTEMS USING (3K+1)-<font>ary</font> INPUT RELATIONS

0 references

The dynamic complexity of formal languages

0 references

0 references

0 references

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

0 references

Dyn-FO: A parallel, dynamic complexity class

0 references

Lower bounds for dynamic connectivity

0 references

Multiply-Recursive Upper Bounds with Higman’s Lemma

0 references

Dynamic complexity theory revisited

0 references

On the Quantifier-Free Dynamic Complexity of Reachability

0 references

Dynamic conjunctive queries

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.ic.2014.09.011

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2514150

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