Complexity, convexity and combinations of theories
Open Access
- 30 November 1980
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 12 (3) , 291-302
- https://doi.org/10.1016/0304-3975(80)90059-6
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Variations on the Common Subexpression ProblemJournal of the ACM, 1980
- The complexity of logical theoriesTheoretical Computer Science, 1980
- A Practical Decision Procedure for Arithmetic with Function SymbolsJournal of the ACM, 1979
- Assignment Commands with Array ReferencesJournal of the ACM, 1978
- An algorithm for reasoning about equalityCommunications of the ACM, 1978
- A 222pn upper bound on the complexity of Presburger ArithmeticJournal of Computer and System Sciences, 1978
- Reasoning about recursively defined data structuresPublished by Association for Computing Machinery (ACM) ,1978
- Bounds on positive integral solutions of linear Diophantine equationsProceedings of the American Mathematical Society, 1976
- Some Completeness Results in the Mathematical Theory of ComputationJournal of the ACM, 1968