Searching for "Area-Time Complexity for VLSI" – sorted by Relevance.
-
Area-Time Performances of Some Neural Computations
- , Boolean functions, Fn,m , fan-in, area-time complexity, VLSI. I. INTRODUCTION I N this paper we shall
- Cited by 5 (5 self) – Add To MetaCart
-
[Razborov 1990] A. A. Razborov, "On the Distributional Complexity of Disjointness ",
- Theoretical Foundation", Prentice Hall, 1995. [Thompson 1979] C. D. Thompson, "Area-Time Complexity for VLSI
- Add To MetaCart
-
Succinct Representation of Graphs Project report for Formal Semantics and Verification (CS388S)
- that whenever the area-time complexity was quadratic in the VLSI model, then any OBDD representation
- Add To MetaCart
-
Implications of Voltage Scaling in Asynchronous Architectures
- processor [3]. Other work has examined bounds on the area and time complexity of VLSI algorithms
- Add To MetaCart
-
On
- it is closely related to the area/time complexity of VLSI circuits and to the width of branching programs. Thus
- Add To MetaCart
-
[118] L. G. Valiant and G. J. Brebner, "Universal Schemes for Parallel Computations ",
- , "Area time complexity for VLSI", Proc. 11th Annual ACM Symposium on Theory of Computing, pp. 81-88, 1979
- Add To MetaCart
-
Biographical Sketch
- , Germany: Springer Verlag, June 1991. [77] C. D. Thompson, "Area-Time Complexity for VLSI," in Proceedings
- Add To MetaCart

