A Nontrivial Lower Bound for an NP Problem on Automata (Q3477958): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0219028 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2082154422 / rank | |||
Normal rank | |||
Latest revision as of 20:20, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Nontrivial Lower Bound for an NP Problem on Automata |
scientific article |
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
