scientific article; zbMATH DE number 3353257
From MaRDI portal
zbMath0223.02031MaRDI QIDQ5628106
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10)
Related Items
Uniform constant-depth threshold circuits for division and iterated multiplication., Super-exponentials nonprimitive recursive, but rudimentary, Iterated multiplication in \(VTC^0\), Improved bounds on the weak pigeonhole principle and infinitely many primes from weaker axioms, Arithmetic circuits: the chasm at depth four gets wider, Rudimentary reductions revisited, Limits on alternation trading proofs for time-space lower bounds, The communication complexity of addition, The role of rudimentary relations in complexity theory, Time-space tradeoffs for SAT on nonuniform machines, Bounded arithmetic, proof complexity and two papers of Parikh, Nonerasing, counting, and majority over the linear time hierarchy, A time lower bound for satisfiability
