Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma (Q5130843): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/18m1195887 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3009964738 / rank | |||
Normal rank | |||
Latest revision as of 10:45, 30 July 2024
scientific article; zbMATH DE number 7268367
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma |
scientific article; zbMATH DE number 7268367 |
Statements
Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma (English)
0 references
29 October 2020
0 references
circuit complexity
0 references
lower bounds
0 references
nondeterminism
0 references
Merlin-Arthur protocols
0 references
ACC
0 references
satisfiability
0 references
pseudorandomness
0 references
0 references
0 references
0 references
