Decision tree complexity of Boolean functions

Hajnal Péter: Decision tree complexity of Boolean functions.
In: Sets, graphs and numbers. Colloquia mathematica Societatis János Bolyai (60). North-Holland Publishing Co. ; János Bolyai Mathematical Society, Amsterdam; Budapest, pp. 375-389. (1992) ISBN 0-444-98681-2

[img]
Preview
Text
2518917.pdf - Accepted Version

Download (182kB) | Preview
Item Type: Book Section
Date: 1992
Number: 60
Page Range: pp. 375-389
ISSN: 0139-3383
ISBN: 0-444-98681-2
Publisher: North-Holland Publishing Co. ; János Bolyai Mathematical Society
Place of Publication: Amsterdam; Budapest
Faculty: Faculty of Science and Mathematics
Institution: Szegedi Tudományegyetem
SWORD language: Angol
Identification Number: 2518917
Date Deposited: 2015. Dec. 18. 13:23
Last Modified: 2015. Dec. 18. 13:23
URI: http://publicatio.bibl.u-szeged.hu/id/eprint/5938

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year