Negation-Limited Circuit Complexity of Symmetric Functions
暂无分享,去创建一个
[1] Tetsuro Nishino,et al. More on the complexity of negation-limited circuits , 1995, STOC '95.
[2] Michael J. Fischer. Hauptvortrag: The complexity of negation-limited networks - A brief survey , 1975, Automata Theory and Formal Languages.
[3] E. Szemerédi,et al. Sorting inc logn parallel steps , 1983 .
[4] E. A. Lamagna,et al. Combinational Complexity of Some Monotone Functions , 1974, SWAT.
[5] Miklos Santha,et al. Limiting Negations in Constant Depth Circuits , 1993, SIAM J. Comput..
[6] Noga Alon,et al. The monotone circuit complexity of boolean functions , 1987, Comb..
[7] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .
[8] János Komlós,et al. An 0(n log n) sorting network , 1983, STOC.
[9] Tadao Kasami,et al. Minimal Negative Gate Networks , 1972, IEEE Transactions on Computers.
[10] A. A. Markov. On the Inversion Complexity of a System of Functions , 1958, JACM.
[11] Tetsuro Nishino,et al. On the complexity of negation-limited Boolean networks , 1994, STOC '94.
[12] Ravi B. Boppana,et al. The Complexity of Finite Functions , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[13] Éva Tardos,et al. The gap between monotone and non-monotone circuit complexity is exponential , 1988, Comb..