A Nontrivial Lower Bound for an NP Problem on Automata (Q3477958)
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 4147509
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Nontrivial Lower Bound for an NP Problem on Automata |
scientific article; zbMATH DE number 4147509 |
Statements
A Nontrivial Lower Bound for an NP Problem on Automata (English)
0 references
1990
0 references
NP-complete problem
0 references
random access machine
0 references
linear time reduction
0 references
reduction of automata
0 references
Turing machine
0 references
Incompletely Specified Automata
0 references
spectrum of a first-order sentence
0 references
0.91119015
0 references
0.90344715
0 references
0 references
0.87517357
0 references
0.8749889
0 references
0.87385774
0 references
0.87090635
0 references
0.8685057
0 references
0.8681004
0 references
