Algorithms and lower bounds for De Morgan formulas of low-communication leaf gates (Q5066142)
From MaRDI portal
!
WARNING
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 7499571
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms and lower bounds for De Morgan formulas of low-communication leaf gates |
scientific article; zbMATH DE number 7499571 |
Statements
Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates (English)
0 references
29 March 2022
0 references
De Morgan formulas
0 references
circuit lower bounds
0 references
satisfiability
0 references
pseudorandom generators
0 references
learning
0 references
communication complexity
0 references
parities
0 references
0.9963214993476868
0 references
0.7730289101600647
0 references
0.7686270475387573
0 references
0.7686269879341125
0 references
0.7654402256011963
0 references
