On the number of generators for transeunt triangles-Reference-Cited by-同舟云学术

On the number of generators for transeunt triangles

Published:2001-03 Issue:3 Volume:108 Page:309-316
ISSN:0166-218X
Container-title:Discrete Applied Mathematics
language:en
Short-container-title:Discrete Applied Mathematics

Author:

Butler J.T.,Dueck G.W.,Yanushkevich S.N.,Shmerko V.P.

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference5 articles.

1. J.T. Butler, G.W. Dueck, V.P. Shmerko, S.N. Yanushkevich, An efficient algorithm for the synthesis of fixed polarity Reed–Muller expansions of symmetric functions, preprint, 1999.

2. Four encounters with Sierpiński's Gasket;Stewart;J. Math. Intell.,1999

3. V.P. Suprun, Polynomial expression of symmetric Boolean functions, Izvestija AN USSR. Techn. Kibernetika (4) (1985) 123–127 (in Russian).

4. V.P. Suprun, Fixed polarity Reed–Muller expressions of symmetric Boolean functions, Proceedings of IFIP WG 10.5 Workshop on Application of the Reed–Muller Expansions in Circuit Design, 1995, pp. 246–249.

5. S. Wolfram, Theory and applications of cellular automata, World Scientific, Singapore, p. 485–557 (http://www.stephenwolfram.com/publications/articles/ca/86-caappendix/2/text.html), 1986.

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

1. Fixed Polarity Pascal Transforms with Symbolic Computer Algebra Applications;2019 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM);2019-08

2. Natural Computing Paradigms for Predictable Nanoelectronics;Journal of Computational and Theoretical Nanoscience;2010-02-01

3. Enumeration of Bent Boolean Functions by Reconfigurable Computer;2010 18th IEEE Annual International Symposium on Field-Programmable Custom Computing Machines;2010

4. Fundamental Expansions;Computer Arithmetics for Nanoelectronics;2009-02-23

5. Natural Computing;Computer Arithmetics for Nanoelectronics;2009-02-23