A note on monotone real circuits
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F18%3A00482972" target="_blank" >RIV/67985840:_____/18:00482972 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.ipl.2017.11.002" target="_blank" >http://dx.doi.org/10.1016/j.ipl.2017.11.002</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ipl.2017.11.002" target="_blank" >10.1016/j.ipl.2017.11.002</a>
Alternative languages
Result language
angličtina
Original language name
A note on monotone real circuits
Original language description
We show that if a Boolean function f:(0,1)n ... (0,1) can be computed by a monotone real circuit of size s using k-ary monotone gates then f can be computed by a monotone real circuit of size O(snk-2) which uses unary or binary monotone gates only. This partially solves an open problem presented in [2]. In fact, in size O(snk-1), the circuit uses only unary monotone gates and binary addition. We also show that if the monotone Karchmer-Wigderson game of f can be solved by a real communication protocol of size s then f can be computed by a monotone real circuit of the same size.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2018
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Information Processing Letters
ISSN
0020-0190
e-ISSN
—
Volume of the periodical
131
Issue of the periodical within the volume
March
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
5
Pages from-to
15-19
UT code for WoS article
000423005700003
EID of the result in the Scopus database
2-s2.0-85034417207