Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma (Q5130843): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: Wikidata QID (P12): Q124882178, #quickstatements; #temporary_batch_1711574657256 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q124882178 / rank | |||
Normal rank | |||
Revision as of 01:02, 28 March 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
