Author:
Boyar Joan,Find Magnus Gausdal
Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Aaronson, S.: Thread on cstheory.stackexchange.com,
http://cstheory.stackexchange.com/questions/1794/circuit-lower-bounds-over-arbitrary-sets-of-gates
2. Boyar, J., Find, M.: Cancellation-free circuits in unbounded and bounded depth. arXiv preprint (1305.3041) (May 2013)
3. Boyar, J., Matthews, P., Peralta, R.: Logic minimization techniques with applications to cryptology. J. Cryptology 26(2), 280–312 (2013)
4. Lecture Notes in Computer Science;D. Canright,2005
5. Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comput. 17(2), 230–261 (1988)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献