Cited By
View all- Hotz GWu H(2006)On the arrangement complexity of uniform treesFoundations of Computer Science10.1007/BFb0052102(337-350)Online publication date: 16-May-2006
On the assignment complexity of uniform trees
Pages 95 - 104
References
[1]
J. A. Abraham and D. D. Gajski. Design of testable structure defined by simple loops. IEEE Trans. on Computers, C-30, 1981.
[2]
B. Becker, and J. Hartmann. Optimal-time multipliers and C-testability. Proceeding8 of the ~nd Annual Symposium on Parallel Algorithms and Architectures, pp146-154, 1990.
[3]
B. Becker and U'. Sparmann, Computations over Finite Monoids and their Test Complexity, Theoretical Computer Science, pp225-250, 1991.
[4]
D. Bhattacharya and J. P. Hayes. Fast and easily testable implementation of arithmetic functions. Proceedings of the 16th International Symposium on Fault Tolerant Computing Systems, July 1986.
[5]
R. Fritzemeier, J. Soden, R. K. Treece, and C. Hawkins. Increased CMOS IC stuck-at fault coverage with reduced IDDQ test sets. Proceedings of ITC. pp427-435, 1990.
[6]
J. P. Hayes, On realizations of boolean functions requiring a minimal or near-minimal number of tests, IEEE Trans. on Computers C-20, pp1506- 1513, 1971.
[7]
G. Markowsky. A straightforward technique for producing minimal multiple fault test sets for fanout-free combinational circuits. Technical Report RC 6222, IBM T. J. Watson Research Center, Yorktown Heights, 1976.
[8]
Christos H. Papadimitriou and K, Steiglitz, Combinatorial Optimization-Algorithms and Complexity, Prentice-Hall, Inc., 1982.
[9]
S.C. Seth, and K.L. Kodandapani. Diagnosis of faults in linear tree networks. IEEE Trans. on Computers, C-26(1), pp29-33, :}an. 1977.
[10]
H. Wu, "On Tests of Uniform Tree Circuits", Proceedings of Second Joint International Conference on Vector and Parallel Processing, pp527-538,1992. {Lecture Notes in Computer Science 634).
[11]
H. Wu, U. Sparmann, "On the Assignment Complexity of VLSI Tree Systems", Proceeding of The Seventh International Symposium on Computer and Information Sciences, pp97-103, 1992.
[12]
H. Wu, "On the Test Complexity of Tree VLSI Systems", Technical Report, SFB 124-B1, 08/1992, FB-Informatik, Universit~t des Saarlandes, Germany.
Index Terms
- On the assignment complexity of uniform trees
Recommendations
Computational complexity for uniform orientation Steiner tree problems
ACSC '13: Proceedings of the Thirty-Sixth Australasian Computer Science Conference - Volume 135We present a straighforward proof that the uniform orientation Steiner tree problem, also known as the λ-geometry Steiner tree problem, is NP-hard whenever the number of orientations, λ, is a multiple of 3. We also briefly outline how this result can be ...
On the Complexity of Optimal Hotlink Assignment
The concept of hotlink assignment aims at reducing the navigation effort for users of a web directory or similar structure by inserting a limited number of additional hyperlinks called hotlinks. Given an access probability distribution of the leaves of ...
Complexity of independency and cliquy trees
AbstractAn independency (cliquy) tree of an n-vertex graph G is a spanning tree of G in which the set of leaves induces an independent set (clique). We study the problems of minimizing or maximizing the number of leaves of such trees, and ...
Comments
Information & Contributors
Information
Published In
Copyright © 1993 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 August 1993
Check for updates
Qualifiers
- Article
Conference
ISSAC93
Sponsor:
Acceptance Rates
Overall Acceptance Rate 395 of 838 submissions, 47%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 77Total Downloads
- Downloads (Last 12 months)25
- Downloads (Last 6 weeks)4
Reflects downloads up to 01 Nov 2024
Other Metrics
Citations
Cited By
View all- Hotz GWu H(2006)On the arrangement complexity of uniform treesFoundations of Computer Science10.1007/BFb0052102(337-350)Online publication date: 16-May-2006
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in