Reducibility among Combinatorial Problems (Q4999425): Difference between revisions
From MaRDI portal
Changed an 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.1007/978-1-4684-2001-2_9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2401610261 / rank | |||
Normal rank |
Latest revision as of 19:15, 19 March 2024
scientific article; zbMATH DE number 7368884
Language | Label | Description | Also known as |
---|---|---|---|
English | Reducibility among Combinatorial Problems |
scientific article; zbMATH DE number 7368884 |
Statements
Reducibility among Combinatorial Problems (English)
0 references
6 July 2021
0 references
polynomial time
0 references
Turing machine
0 references
regular expression
0 references
combinatorial problem
0 references
words over a finite alphabet
0 references
language recognition
0 references