Recursion versus tail recursion over \(\overline{\mathbb{F}}_p\)

DOI10.1016/j.jlamp.2017.08.003zbMath1476.03062OpenAlexW2760959810MaRDI QIDQ1683704

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 fieldstail recursiongeneralized recursion theory

Mathematics Subject Classification ID

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

Cites Work

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

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