Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma (Q5130843): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:14, 8 February 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
