One-tape Turing machine and branching program lower bounds for MCSP (Q6614616)
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: One-tape Turing machine and branching program lower bounds for MCSP |
scientific article; zbMATH DE number 7922396
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | One-tape Turing machine and branching program lower bounds for MCSP |
scientific article; zbMATH DE number 7922396 |
Statements
One-tape Turing machine and branching program lower bounds for MCSP (English)
0 references
7 October 2024
0 references
minimum circuit size problem
0 references
Kolmogorov complexity
0 references
one-tape Turing machines
0 references
branching programs
0 references
lower bounds
0 references
pseudorandom generators
0 references
hitting set generators
0 references
0 references
0 references
