On Ajtai's lower bound technique for \(R\)-way branching programs and the Hamming distance problem (Q3594440)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On Ajtai's lower bound technique for R-way branching programs and the Hamming distance problem |
scientific article; zbMATH DE number 5177918
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Ajtai's lower bound technique for \(R\)-way branching programs and the Hamming distance problem |
scientific article; zbMATH DE number 5177918 |
Statements
8 August 2007
0 references
0.8199925422668457
0 references
0.7959843277931213
0 references
0.7932508587837219
0 references
0.7865557074546814
0 references
0.7832289338111877
0 references
