A nondeterministic space-time tradeoff for linear codes (Q976097)
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: A nondeterministic space-time tradeoff for linear codes |
scientific article; zbMATH DE number 5721988
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A nondeterministic space-time tradeoff for linear codes |
scientific article; zbMATH DE number 5721988 |
Statements
A nondeterministic space-time tradeoff for linear codes (English)
0 references
16 June 2010
0 references
computational complexity
0 references
branching programs
0 references
lower bounds
0 references
linear codes
0 references
0.7775806188583374
0 references
0.776213526725769
0 references
0.7604236006736755
0 references
