scientific article
From MaRDI portal
Publication:4035303
zbMath0765.68034MaRDI QIDQ4035303
Publication date: 18 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
PRAMparallel complexity classesconcentration recursion on notationweak bounded recursion on notation
Related Items
Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits ⋮ The equivalence of theories that characterize ALogTime ⋮ Separations of theories in weak bounded arithmetic ⋮ Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\) ⋮ Recursion theoretic characterizations of complexity classes of counting functions ⋮ A query language for NC ⋮ On parallel hierarchies and \(R_k^i\) ⋮ Nondeterministic stack register machines ⋮ On the coincidence of complexity classes BPC and \(\text{TC}^0 \) ⋮ Computation models and function algebras ⋮ Characterizing parallel time by type 2 recursions with polynomial output length ⋮ A query language for NC (extended abstract) ⋮ A Characterization of NC k by First Order Functional Programs ⋮ New substitution bases for complexity classes ⋮ A bounded arithmetic AID for Frege systems ⋮ Bounded arithmetic for NC, ALogTIME, L and NL ⋮ A constant-space sequential model of computation for first-order logic ⋮ Bounded monotone recursion and multihead automata ⋮ Unnamed Item ⋮ A constant-space sequential model of computation for first-order logic ⋮ Frege proof system and TNC° ⋮ Implicit characterizations of FPTIME and NC revisited
This page was built for publication:
