Function-algebraic characterizations of log and polylog parallel time
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 440478 (Why is no real title available?)
- scientific article; zbMATH DE number 176211 (Why is no real title available?)
- A bounded arithmetic AID for Frege systems
- A new recursion-theoretic characterization of the polytime functions
- An algebra and a logic for \(NC^ 1\)
- Arithmetizing uniform \(NC\)
- Bounded arithmetic for NC, ALogTIME, L and NL
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- On uniform circuit complexity
Cited in
(15)- scientific article; zbMATH DE number 1956513 (Why is no real title available?)
- scientific article; zbMATH DE number 1390027 (Why is no real title available?)
- Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits
- A Characterization of Alternating Log Time by First Order Functional Programs
- scientific article; zbMATH DE number 176199 (Why is no real title available?)
- A Characterization of NC k by First Order Functional Programs
- Constant time parallel computations in \(\lambda\)-calculus
- Characterizing parallel time by type 2 recursions with polynomial output length
- Computation models and function algebras
- On parallel hierarchies and R ki
- A characterization of alternating log time by ramified recurrence
- Implicit characterizations of FPTIME and NC revisited
- scientific article; zbMATH DE number 7559295 (Why is no real title available?)
- On the computational complexity of imperative programming languages
- Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time
This page was built for publication: Function-algebraic characterizations of log and polylog parallel time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1332666)
