🔧На сайте запланированы технические работы
25.12.2025 в промежутке с 18:00 до 21:00 по Московскому времени (GMT+3) на сайте будут проводиться плановые технические работы. Возможны перебои с доступом к сайту. Приносим извинения за временные неудобства. Благодарим за понимание!
🔧Site maintenance is scheduled.
Scheduled maintenance will be performed on the site from 6:00 PM to 9:00 PM Moscow time (GMT+3) on December 25, 2025. Site access may be interrupted. We apologize for the inconvenience. Thank you for your understanding!

 

On Block Sensitivity and Fractional Block Sensitivity


Citar

Texto integral

Acesso aberto Acesso aberto
Acesso é fechado Acesso está concedido
Acesso é fechado Somente assinantes

Resumo

We investigate the relation between the block sensitivity bs(f) and fractional block sensitivity fbs(f) complexity measures of Boolean functions. While it is known that fbs(f) = O(bs(f)2), the best known separation achieves \({\rm{fbs}}\left( f \right) = \left( {{{\left( {3\sqrt 2 } \right)}^{ - 1}} + o\left( 1 \right)} \right){\rm{bs}}{\left( f \right)^{3/2}}\). We improve the constant factor and show a family of functions that give fbs(f) = (6−1/2o(1)) bs(f)3/2.

Sobre autores

A. Ambainis

Faculty of Computing

Autor responsável pela correspondência
Email: andris.ambainis@lu.lv
Letônia, Raiņa bulv. 19, Rīga, LV-1586

K. Prūsis

Faculty of Computing

Email: andris.ambainis@lu.lv
Letônia, Raiņa bulv. 19, Rīga, LV-1586

J. Vihrovs

Faculty of Computing

Email: andris.ambainis@lu.lv
Letônia, Raiņa bulv. 19, Rīga, LV-1586

Arquivos suplementares

Arquivos suplementares
Ação
1. JATS XML

Declaração de direitos autorais © Pleiades Publishing, Ltd., 2018