Work-sensitive dynamic complexity of formal languages
From MaRDI portal
Publication:2233429
Cites work
- scientific article; zbMATH DE number 3965451 (Why is no real title available?)
- scientific article; zbMATH DE number 107951 (Why is no real title available?)
- scientific article; zbMATH DE number 1254648 (Why is no real title available?)
- scientific article; zbMATH DE number 618821 (Why is no real title available?)
- scientific article; zbMATH DE number 1161568 (Why is no real title available?)
- scientific article; zbMATH DE number 3368555 (Why is no real title available?)
- Abstract state machines: a unifying view of models of computation and of system design frameworks
- Complexity models for incremental computation
- Dyn-FO: A parallel, dynamic complexity class
- Dynamic Complexity under Definable Changes
- Dynamic algorithms for the Dyck languages
- Dynamic nested brackets
- Dynamic word problems
- Elements of finite model theory.
- Experimental descriptive complexity
- Fully-dynamic planarity testing in polylogarithmic time
- If the current clique algorithms are optimal, so is Valiant's parser
- Multiplying matrices faster than coppersmith-winograd
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Powers of tensors and fast matrix multiplication
- Reachability is in DynFO
- The dynamic complexity of formal languages
- Work-sensitive dynamic complexity of formal languages
This page was built for publication: Work-sensitive dynamic complexity of formal languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2233429)
