Corrigendum to: ``Revisiting reachability in polynomial interrupt timed automata'' (Q2059913)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Corrigendum to: ``Revisiting reachability in polynomial interrupt timed automata |
scientific article; zbMATH DE number 7444838
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Corrigendum to: ``Revisiting reachability in polynomial interrupt timed automata'' |
scientific article; zbMATH DE number 7444838 |
Statements
Corrigendum to: ``Revisiting reachability in polynomial interrupt timed automata'' (English)
0 references
14 December 2021
0 references
computational complexity
0 references
lower bound
0 references
reachability
0 references
existential theory of reals
0 references
0.93188727
0 references
0.8909919
0 references
0.8673234
0 references
0.86239004
0 references
0.8483956
0 references
0.84106195
0 references
0 references
