Query complexity of matroids (Q4924658)
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: Query complexity of matroids |
scientific article; zbMATH DE number 6172014
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Query complexity of matroids |
scientific article; zbMATH DE number 6172014 |
Statements
Query Complexity of Matroids (English)
0 references
7 June 2013
0 references
(parity, randomized, quantum) decision tree complexity
0 references
matroids
0 references
Fourier spectrum
0 references
read-once formulae
0 references
0.7353935241699219
0 references
0.7353935241699219
0 references
0.7281028032302856
0 references
0.727591335773468
0 references
