Pointers in recursion: exploring the tropics

DOI10.4230/LIPICS.FSCD.2019.29MaRDI QIDQ5089032FDOQ5089032

Authors:

Publication date: 18 July 2022

Recommendations

• scientific article; zbMATH DE number 806752
• Characterizing PSPACE with pointers
• Recursion versus tail recursion over \(\overline{\mathbb{F}}_p\)
• scientific article; zbMATH DE number 1342252
• Tailoring recursion for complexity

zbMATH Keywords

recursion theoryimplicit complexity

Mathematics Subject Classification ID

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

Cites Work

• On uniform circuit complexity
• 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.
• A characterization of alternating log time by ramified recurrence
• Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits
• Alternation
• Title not available (Why is that?)
• Programming Languages and Systems
• Arithmetizing uniform \(NC\)
• Pure pointer programs with iteration
• Recursion schemata for slowly growing depth circuit classes

Cited In (1)

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

This page was built for publication: Pointers in recursion: exploring the tropics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089032)