scientific article; zbMATH DE number 7559295

DOI10.4230/LIPIcs.FSCD.2019.29MaRDI QIDQ5089032

Unnamed Author

Publication date: 18 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

recursion theoryimplicit complexity

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of computing (68Qxx)

Related Items (1)

\textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs

Cites Work

• Unnamed Item
• Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits
• On uniform circuit complexity
• Arithmetizing uniform \(NC\)
• A new recursion-theoretic characterization of the polytime functions
• Function-algebraic characterizations of log and polylog parallel time
• Linear types and non-size-increasing polynomial time computation.
• Recursion schemata for slowly growing depth circuit classes
• A characterization of alternating log time by ramified recurrence
• Pure pointer programs with iteration
• Alternation
• Programming Languages and Systems

This page was built for publication: