Recursion versus tail recursion over F_p

DOI10.1016/J.JLAMP.2017.08.003MaRDI QIDQ1683704zbMATH OpenOpenAlexFDO

Authors Siddharth Bhaskar

Publication date 1 December 2017

Published in Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jlamp.2017.08.003

zbMATH Keywords

finite fieldsgeneralized recursion theorytail recursion

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Abstract and axiomatic computability and recursion theory (03D75)

Recommendations

• A difference in complexity between recursion and tail recursion
• scientific article; zbMATH DE number 2013793
• Tailoring recursion for complexity
• Program algebras of recursive functions
• scientific article; zbMATH DE number 1499100

Cites work

• A difference in expressive power between flowcharts and recursion schemes
• A simplified proof of \(DDL<DL\)
• Algorithmic Procedures
• An infinite pebble game and applications
• Backing up in singly linked lists
• Choiceless polynomial time
• Finite alogorithmic procedures and computation theories.
• scientific article; zbMATH DE number 424718 (Why is no real title available?)
• scientific article; zbMATH DE number 3622921 (Why is no real title available?)
• LOGSPACE and PTIME characterized by programming languages
• Revisiting Gauss's analogue of the prime number theorem for polynomials over a finite field
• Theory of program structures: Schemes, semantics, verification

Cited in

(2)

• Pointers in recursion: exploring the tropics
• A difference in complexity between recursion and tail recursion

This page was built for publication: Recursion versus tail recursion over \(\overline{\mathbb{F}}_p\)

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