Mean computing time of Boolean operators by programs with restricted memory

Autor:	A. V. Chashkin
Rok vydání:	2017
Předmět:	Discrete mathematics Boolean domain Combinatorics Boolean network Parity function General Mathematics Two-element Boolean algebra Maximum satisfiability problem Boolean expression Complete Boolean algebra Standard Boolean model Mathematics
Zdroj:	Moscow University Mathematics Bulletin. 72:102-106
ISSN:	1934-8444 0027-1322
DOI:	10.3103/s0027132217030032
Popis:	The mean computing time for computation of values of Boolean operators by straight-line programs with a conditional stop and the storage of at most D is studied. An asymptotically exact formula for the mean computation time is obtained for growing number n of variables and for almost all Boolean operators with m components in a wide range of D and m.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::c3fcea0799f14d6a7a055e0452954eeb https://doi.org/10.3103/s0027132217030032 Zobrazit plný text záznamu Full text from SpringerLink