Nested Canalyzing, Unate Cascade, and Polynomial Functions.
暂无分享,去创建一个
Abdul Salam Jarrah | Blessilda Raposa | Reinhard Laubenbacher | Blessilda P. Raposa | R. Laubenbacher | A. Jarrah
[1] Grant Pogosyan. The number of cascade functions , 1999, Proceedings 1999 29th IEEE International Symposium on Multiple-Valued Logic (Cat. No.99CB36329).
[2] H. Niederreiter,et al. Finite Fields: Encyclopedia of Mathematics and Its Applications. , 1997 .
[3] W. J. Thron,et al. Encyclopedia of Mathematics and its Applications. , 1982 .
[4] M. Stern,et al. Emergence of homeostasis and "noise imprinting" in an evolution model. , 1999, Proceedings of the National Academy of Sciences of the United States of America.
[5] Pao-Ta Yu,et al. Convergence behavior and N-roots of stack filters , 1990, IEEE Trans. Acoust. Speech Signal Process..
[6] Stuart A. Kauffman,et al. The origins of order , 1993 .
[7] Tsutomu Sasao,et al. Average path length of binary decision diagrams , 2005, IEEE Transactions on Computers.
[8] A. Mukhopadhyay. Unate Cellular Logic , 1969, IEEE Transactions on Computers.
[9] W. Fulton. Introduction to Toric Varieties. , 1993 .
[10] K. Conrad,et al. Finite Fields , 2018, Series and Products in the Development of Mathematics.
[11] L. Amaral,et al. Canalizing Kauffman networks: nonergodicity and its effect on their critical behavior. , 2005, Physical review letters.
[12] W. Just,et al. The number and probability of canalizing functions , 2003, math-ph/0312033.
[13] James F. Lynch. On the Threshold of Chaos in Random Boolean Cellular Automata , 1995, Random Struct. Algorithms.
[14] R. Laubenbacher,et al. A computational algebra approach to the reverse engineering of gene regulatory networks. , 2003, Journal of theoretical biology.
[15] William Fulton,et al. Introduction to Toric Varieties. (AM-131) , 1993 .
[16] Edward J. Coyle,et al. Stack filters , 1986, IEEE Trans. Acoust. Speech Signal Process..
[17] Pao-Ta Yu,et al. Convergence behavior and root signal sets of stack filters , 1992 .
[18] B. Sturmfels. Gröbner bases and convex polytopes , 1995 .
[19] John P. Hayes. Enumeration of Fanout-Free Boolean Functions , 1976, JACM.
[20] S. Kauffman,et al. Genetic networks with canalyzing Boolean rules are always stable. , 2004, Proceedings of the National Academy of Sciences of the United States of America.
[21] 伊吹 公夫. Cascaded Switching Networks of Two-Input Flexible Cells , 1962 .
[22] Edward A. Bender,et al. The Number of Fanout-Free Functions with Various Gates , 1980, JACM.
[23] Dietrich Stauffer. On forcing functions in Kauffman's random Boolean networks , 1987 .
[24] Jon T. Butler,et al. Asymptotic Approximations for the Number of Fanout-Free Functions , 1978, IEEE Transactions on Computers.
[25] Carsten Peterson,et al. Random Boolean network models and the yeast transcriptional network , 2003, Proceedings of the National Academy of Sciences of the United States of America.
[26] C. Waddington. Canalization of Development and the Inheritance of Acquired Characters , 1942, Nature.
[27] Kozo Kinoshita,et al. On the Number of Fanout-Free Functions and Unate Cascade Functions , 1979, IEEE Transactions on Computers.