Cancellation-free circuits in unbounded and bounded depth
暂无分享,去创建一个
[1] Michael Clausen,et al. Algebraic complexity theory , 1997, Grundlehren der mathematischen Wissenschaften.
[2] David Canright,et al. A Very Compact S-Box for AES , 2005, CHES.
[3] Stasys Jukna,et al. Boolean Function Complexity Advances and Frontiers , 2012, Bull. EATCS.
[4] Nicholas Pippenger,et al. On the Evaluation of Powers and Monomials , 1980, SIAM J. Comput..
[5] Robert Kennes,et al. Computational aspects of the Mobius transformation of graphs , 1992, IEEE Trans. Syst. Man Cybern..
[6] Akashi Satoh,et al. A Compact Rijndael Hardware Architecture with S-Box Optimization , 2001, ASIACRYPT.
[7] V. Sós,et al. On a problem of K. Zarankiewicz , 1954 .
[8] Igor Sergeev,et al. On additive complexity of a sequence of matrices , 2012, ArXiv.
[9] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[10] Joan Boyar,et al. Logic Minimization Techniques with Applications to Cryptology , 2013, Journal of Cryptology.
[11] Stasys Jukna,et al. Disproving the Single Level Conjecture , 2006, SIAM J. Comput..
[12] Oded Goldreich,et al. Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity , 1988, SIAM J. Comput..
[13] Nicholas Pippenger,et al. On Another Boolean Matrix , 1980, Theor. Comput. Sci..
[14] Ingo Wegener,et al. A new lower bound on the monotone network complexity of Boolean sums , 1980, Acta Informatica.
[15] Jacques Morgenstern,et al. Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform , 1973, JACM.
[16] Oded Goldreich,et al. Unbiased bits from sources of weak randomness and probabilistic communication complexity , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[17] Volker Strassen,et al. Algebraic Complexity Theory , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[18] Mikko Koivisto,et al. Separating OR, SUM, and XOR circuits , 2013, J. Comput. Syst. Sci..
[19] A. Razborov. Communication Complexity , 2011 .
[20] Ran Raz,et al. Improved Average-Case Lower Bounds for DeMorgan Formula Size , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.
[21] Stasys Jukna,et al. Extremal Combinatorics - With Applications in Computer Science , 2001, Texts in Theoretical Computer Science. An EATCS Series.
[22] S. Selezneva. Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables , 2013 .
[23] Noga Alon,et al. Linear Circuits over GF(2) , 1990, SIAM J. Comput..
[24] Christof Paar,et al. Some remarks on efficient inversion in finite fields , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.
[25] Kurt Mehlhorn,et al. Some remarks on Boolean sums , 1979, Acta Informatica.
[26] Igor S. Sergeev,et al. On the complexity of linear boolean operators with thin matrices , 2011 .
[27] Eyal Kushilevitz,et al. Communication Complexity: Index of Notation , 1996 .
[28] Stasys Jukna,et al. Complexity of Linear Boolean Operators , 2013, Found. Trends Theor. Comput. Sci..
[29] Kyriakos Kalorkoti. ALGEBRAIC COMPLEXITY THEORY (Grundlehren der Mathematischen Wissenschaften 315) , 1999 .
[30] Nicholas Pippenger,et al. On the evaluation of powers and related problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).