## Abstract This paper discusses the complexity from the viewpoint of the number of circuit elements for the slice functions and the homogeneous function, which belong to the class of monotonic logic functions. The slice function is one of those functions in which the circuit complexity is almost e
β¦ LIBER β¦
Graph Complexity and Slice Functions
β Scribed by V. Lokam
- Publisher
- Springer
- Year
- 2003
- Tongue
- English
- Weight
- 139 KB
- Volume
- 36
- Category
- Article
- ISSN
- 1433-0490
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Circuit complexity of slice functions an
β
Shoichi Hirose; Shuzo Yajima
π
Article
π
1994
π
John Wiley and Sons
π
English
β 644 KB
The complexity of central slice function
β
Paul E. Dunne
π
Article
π
1986
π
Elsevier Science
π
English
β 593 KB
More on the complexity of slice function
β
Ingo Wegener
π
Article
π
1986
π
Elsevier Science
π
English
β 664 KB
Assertion-based slicing and slice graphs
β
JosΓ© Bernardo Barros; Daniela da Cruz; Pedro Rangel Henriques; Jorge Sousa Pinto
π
Article
π
2011
π
Springer
π
English
β 836 KB
Mosco and Slice Convergence of Level Set
β
G. Beer; J.M. Borwein
π
Article
π
1993
π
Elsevier Science
π
English
β 616 KB
Zeroes of slice monogenic functions
β
Yan Yang; Tao Qian
π
Article
π
2011
π
John Wiley and Sons
π
English
β 134 KB
## Communicated by W. SprΓΆΓig In this article, we study the structure of zeroes of power series with Clifford algebra-valued coefficients. Especially, if it has paravector-valued coefficients, we obtain some sufficient and necessary conditions of power series that have zeroes, as well as a method