On Shifting Networks

0402599 - UIVT-O 950202 RIV NL eng J - Článek v odborném periodiku
Pudlák, Pavel - Savický, Petr
On Shifting Networks.
Theoretical Computer Science. Roč. 116, - (1993), s. 415-419. ISSN 0304-3975. E-ISSN 1879-2294
Impakt faktor: 0.310, rok: 1993

Citováno: 7

--- CHERUKHIN, D.Y. Boolean circuits with a bounded depth of branching. DOKLADY MATHEMATICS. ISSN 1064-5624, NOV-DEC 2005, vol. 72, no. 3, p. 930-933. [WOS]
--- JUKNA, S. Entropy of Operators or why Matrix Multiplication is Hard for Depth-Two Circuits. THEORY OF COMPUTING SYSTEMS. ISSN 1432-4350, FEB 2010, vol. 46, no. 2, p. 301-310. [WOS]
--- JUKNA, S. Representing (0,1)-matrices by boolean circuits. DISCRETE MATHEMATICS. ISSN 0012-365X, JAN 6 2010, vol. 310, no. 1, p. 184-187. [WOS]
--- CHERUKHIN, D.Y. Lower bounds for depth-2 and depth-3 Boolean circuits with arbitrary gates. COMPUTER SCIENCE - THEORY AND APPLICATIONS. ISSN 0302-9743, 2008, vol. 5010, p. 122-133. [WOS]
--- TSUKIJI, T. Some lower bounds of cyclic shift on Boolean circuits. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES. ISSN 0916-8508, APR 1996, vol. E79A, no. 4, p. 520-523. [WOS]
--- JUKNA, S. - SCHNITGER, G. Min-rank conjecture for log-depth circuits. JOURNAL OF COMPUTER AND SYSTEM SCIENCES. ISSN 0022-0000, NOV 2011, vol. 77, no. 6, SI, p. 1023-1038. [WOS]
--- JUKNA, S. Boolean Function Complexity: Advances and Frontiers. BOOLEAN FUNCTION COMPLEXITY: ADVANCES AND FRONTIERS. ISSN 0937-5511, 2012, vol. 27, p. 3-+. [WOS]

Trvalý link: http://hdl.handle.net/11104/0122997