On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\) (Q1401330)
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: On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\) |
scientific article; zbMATH DE number 1965347
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\) |
scientific article; zbMATH DE number 1965347 |
Statements
On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\) (English)
0 references
17 August 2003
0 references
Complexity class separations
0 references
\(\mathcal{NL},\mathcal{NP}\)
0 references
Finite state automata intersection
0 references
0.9032094
0 references
0.9032092
0 references
0.89493734
0 references
0.8915743
0 references
0.86215985
0 references
0.86006916
0 references
0.86006916
0 references
0.84767425
0 references
