scientific article; zbMATH DE number 176199
From MaRDI portal
Publication:4035303
Recommendations
Cited in
(39)- Implicit characterizations of FPTIME and NC revisited
- Complexity theory of parallel time and hardware
- Characterizing parallel hierarchies by reducibilities
- Bounded arithmetic for NC, ALogTIME, L and NL
- A constant-space sequential model of computation for first-order logic
- Function-algebraic characterizations of log and polylog parallel time
- Separations of theories in weak bounded arithmetic
- ALOGTIME and a conjecture of S. A. Cook
- 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
- Recursion schemata for slowly growing depth circuit classes
- A bounded arithmetic AID for Frege systems
- Bounded monotone recursion and multihead automata
- Quantified propositional calculus and a second-order theory for NC\(^{\text \textbf{1}}\)
- Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits
- A Characterization of NC k by First Order Functional Programs
- Recursion Schemata for NC k
- scientific article; zbMATH DE number 3905850 (Why is no real title available?)
- scientific article; zbMATH DE number 3960998 (Why is no real title available?)
- scientific article; zbMATH DE number 4092776 (Why is no real title available?)
- The parallel complexity of simple logic programs
- Adaptive logspace reducibility and parallel time
- Characterizing NC with tier 0 pointers
- Pointers in recursion: exploring the tropics
- New substitution bases for complexity classes
- On the coincidence of complexity classes BPC and \(\text{TC}^0 \)
- Computation models and function algebras
- Frege proof system and TNC°
- Characterizing parallel time by type 2 recursions with polynomial output length
- A constant-space sequential model of computation for first-order logic
- A query language for NC (extended abstract)
- A note on the relation between polynomial time functionals and Constable's class \(\mathcal K\)
- Towards new characterizations of small circuit classes via discrete ordinary differential equations
- Recursion-theoretic alternation
- A new characterization of FAC^0 via discrete ordinary differential equations
- Characterizing small circuit classes from FAC^0 to FAC^1 via discrete ordinary differential equations
- The equivalence of theories that characterize ALogTime
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035303)
