Abstract
Area-time bounds on VLSI circuits for context-free language recognition, for the evaluation of propositional calculus formulae and for set equality and disjointness questions, are considered. In all cases, a lower bound $AT^{2\alpha } = \Omega (n^{1 + \alpha } )$ is proved, where A is the chip area, T the execution time, and $0 \leqq \alpha \leqq 1$. Similar results were known for computations with $\Omega (n)$-bit outputs, but the computations considered here have only 1-bit outputs. Upper bounds are also discussed.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
