A polynomial-time construction of a hitting set for read-once branching programs of width 3 (Q5862347)
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 7485830
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time construction of a hitting set for read-once branching programs of width 3 |
scientific article; zbMATH DE number 7485830 |
Statements
A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3 (English)
0 references
9 March 2022
0 references
derandomization
0 references
hitting set
0 references
read-once branching program
0 references
bounded width
0 references
almost k-wise independent set
0 references
0 references
0 references
0 references
0 references
0.9457219839096068
0 references
0.9300662875175476
0 references
0.8901866674423218
0 references
0.8405401706695557
0 references
0.8270115256309509
0 references
