Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP (Q5230346)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7097052
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP |
scientific article; zbMATH DE number 7097052 |
Statements
Circuit lower bounds for nondeterministic quasi-polytime: an easy witness lemma for NP and NQP (English)
0 references
22 August 2019
0 references
ACC Merlin-Arthur
0 references
circuit complexity
0 references
lower bounds
0 references
nondeterminism
0 references
pseudorandomness
0 references
satisfiability
0 references
0.9938333630561828
0 references
0.7618218064308167
0 references
0.7414506673812866
0 references
0.7366640567779541
0 references
0.734686017036438
0 references
