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...

Full description

Bibliographic Details

Published in:	Proceedings / IEEE Conference on Computational Complexity pp. 185 - 196
Main Authors:	Gilmer, Justin, Saks, Michael, Srinivasan, Srikanth
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.06.2013
Subjects:	Block sensitivity Boolean functions Certificate complexity Complexity theory Decision trees Educational institutions Fractional Certificate complexity Indexes Iterated composition Sensitivity
ISSN:	1093-0159
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!