Abstract
The standard models for investigating issues in computational complexity in the discrete setting are the Turing machine and the random access machine. However, these models are not well-suited for a discussion of complexity questions in a general algebraic framework, where one assumes that arithmetic operations (over the reals, say) can be performed with infinite-precision at unit cost. For the search of lower bounds in such an algebraic framework, two computational models have proved to be particularly useful: the straight-line program, also called arithmetic circuit, and the computation tree.KeywordsOutput NodeComputation TreeComputation SequenceComputation NodeTest InstructionThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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.
