Subject
General Computer Science,Theoretical Computer Science
Reference30 articles.
1. Quantum lower bounds by quantum arguments;Ambainis;Journal of Computer and System Sciences,2002
2. Any AND–OR formula of size N can be evaluated in time N1/2+o(1) on a quantum computer;Ambainis;SIAM Journal on Computing,2010
3. Decompositions of positive self-dual boolean functions;Bioch;Discrete Mathematics,1995
4. Minimum self-dual decompositions of positive dual-minor boolean functions;Bioch;Discrete Applied Mathematics,1999
5. Playing with boolean blocks, part I: post’s lattice with applications to complexity theory;Böhler;ACM SIGACT News,2003
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献