Finding Lower Bounds for Nondeterministic State Complexity Is Hard (Q3617075)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5533841
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding Lower Bounds for Nondeterministic State Complexity Is Hard |
scientific article; zbMATH DE number 5533841 |
Statements
Finding Lower Bounds for Nondeterministic State Complexity Is Hard (English)
0 references
26 March 2009
0 references
0.8694933652877808
0 references
0.8601284027099609
0 references
0.7879259586334229
0 references
0.783047080039978
0 references
