Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Andreev, A.E.: On a method for obtaining more than quadratic effective lower bounds for the complexity of π-scheme. Moscow University Mathematics Bulletin 42(1), 63–66 (1987)
2. Bioch, J.C., Ibaraki, T.: Decompositions of positive self-dual boolean functions. Discrete Mathematics 140(1-3), 23–46 (1995)
3. Böhler, E., Creignou, N., Reith, S., Vollmer, H.: Playing with boolean blocks, part I: Post’s lattice with applications to complexity theory. ACM SIGACT News 34(4), 38–52 (2003)
4. Chockler, H., Zwick, U.: Which bases admit non-trivial shrinkage of formulae? Computational Complexity 10(1), 28–40 (2001)
5. Fischer, M.J., Meyer, A.R., Paterson, M.S.: Ω(n
log
n) lower bounds on length of Boolean formulas. SIAM Journal on Computing 11(3), 416–427 (1982)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献