Composition Limits and Separating Examples for Some Boolean Function Complexity Measures

Block sensitivity (bs(f)), certificate complexity (C(f)) and fractional certificate complexity (C*(f)) are three fundamental combinatorial measures of complexity of a boolean function f. It has long been known that bs(f) ≤ C*f ≤ C(f) =O(bs(f) 2 ). We provide an infinite family of examples for which...

Celý popis

Podrobná bibliografia

Vydané v:	Proceedings / IEEE Conference on Computational Complexity s. 185 - 196
Hlavní autori:	Gilmer, Justin, Saks, Michael, Srinivasan, Srikanth
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.06.2013
Predmet:	Block sensitivity Boolean functions Certificate complexity Complexity theory Decision trees Educational institutions Fractional Certificate complexity Indexes Iterated composition Sensitivity
ISSN:	1093-0159
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!