The Boolean functions computed by random Boolean formulas or how to grow the right function
From MaRDI portal
Publication:5717773
DOI10.1002/rsa.20095zbMath1083.94024arXivcs/0302028MaRDI QIDQ5717773
Alex Brodsky, Nicholas J. Pippenger
Publication date: 10 January 2006
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0302028
growth processes; computational and structural complexity; random Boolean functions; probabilistic amplification
Related Items