On the complexity of linear boolean operators with thin matrices-Reference-Cited by-同舟云学术

On the complexity of linear boolean operators with thin matrices

Published:2011-04 Issue:2 Volume:5 Page:202-211
ISSN:1990-4789
Container-title:Journal of Applied and Industrial Mathematics
language:en
Short-container-title:J. Appl. Ind. Math.

Author:

Gashkov S. B.,Sergeev I. S.

Publisher

Pleiades Publishing Ltd

Subject

Applied Mathematics,Industrial and Manufacturing Engineering

Link

http://link.springer.com/content/pdf/10.1134/S1990478911020074.pdf

Reference29 articles.

1. N. Alon, M. Karchmer, and A. Wigderson, “Linear Circuits over GF(2)”, SIAM J. Comput. 19(6), 1064–1067 (1990).

2. A. E. Andreev, “On a Family of Boolean Matrices,” Vestnik Moskov. Gos. Univ. Ser. I Mat. Mekh. 2, 97–100 (1986) [Moscow Univ. Math. Bull. 41, 79–82 (1986)].

3. D. J. Bernstein, “The Transposition Principle,” http://cr.yp.to/transposition.html .

4. D. Bini and V. Pan, Polynomial and Matrix Computations, Vol. 1 (Birkhäuser, Boston, 1994).

5. R. E. Blahut, Fast Algorithms for Digital Signal Processing (Addison-Wesley, Advanced Book Program, Reading, MA, 1985; Mir, Moscow, 1989).

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

1. Separating OR, SUM, and XOR circuits;Journal of Computer and System Sciences;2016-08

2. Cancellation-free circuits in unbounded and bounded depth;Theoretical Computer Science;2015-07

3. Complexity of Linear Boolean Operators;Foundations and Trends® in Theoretical Computer Science;2013

4. Cancellation-Free Circuits in Unbounded and Bounded Depth;Fundamentals of Computation Theory;2013

5. A method for deriving lower bounds for the complexity of monotone arithmetic circuits computing real polynomials;Sbornik: Mathematics;2012-10-31