The Boolean functions computed by random Boolean formulas or how to grow the right function-Reference-Cited by-同舟云学术

The Boolean functions computed by random Boolean formulas or how to grow the right function

Published:2005 Issue:4 Volume:27 Page:490-519
ISSN:1042-9832
Container-title:Random Structures and Algorithms
language:en
Short-container-title:Random Struct. Alg.

Author:

Brodsky Alex,Pippenger Nicholas

Publisher

Wiley

Subject

Applied Mathematics,Computer Graphics and Computer-Aided Design,General Mathematics,Software

Reference25 articles.

1. Modular functions and Dirichlet series in number theory, 2nd edition, Springer, New York, 1997.

2. On some relationships between monotone and nonmonotone circuit complexity, Technical report, Department of Computer Science, University of Toronto, Canada, Toronto, Canada, 1982.

3. Amplification of probabilistic Boolean formulas, Proc 26th Annu IEEE Symp Foundations of Computer Science, October, 1985, pp. 20-29.

4. “ Amplification of probabilistic Boolean formulasm,” Advances in computing research 5: Randomness and computation, 28-45. (Editor), JAI Press, Greenwich, CT, 1989.

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Space of Functions Computed by Deep-Layered Machines;Physical Review Letters;2020-10-12

2. Enumerating lambda terms by weighted length of their De Bruijn representation;Discrete Applied Mathematics;2018-04

3. 2-Xor Revisited: Satisfiability and Probabilities of Functions;Algorithmica;2016-02-11

4. The relation between tree size complexity and probability for Boolean functions generated by uniform random trees;Applicable Analysis and Discrete Mathematics;2016

5. Associative and commutative tree representations for Boolean functions;Theoretical Computer Science;2015-03