scientific article; zbMATH DE number 3561331
From MaRDI portal
Publication:4133967
zbMath0361.02061MaRDI QIDQ4133967
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25)
Related Items
(Optimal) duplication is not elementary recursive ⋮ The most nonelementary theory ⋮ THE RECOGNITION COMPLEXITY OF DECIDABLE THEORIES ⋮ Compositional complexity of Boolean functions ⋮ A uniform method for proving lower bounds on the computational complexity of logical theories ⋮ An analysis of the Core-ML language: Expressive power and type reconstruction ⋮ A simple proof of a theorem of Statman ⋮ The typed lambda-calculus is not elementary recursive ⋮ Complexity Hierarchies beyond Elementary ⋮ The complexity of the word problems for commutative semigroups and polynomial ideals ⋮ Parallel beta reduction is not elementary recursive ⋮ On computational complexity of Prolog programs
