Switch to: References

Add citations

You must login to add citations.
  1. Ramified recurrence and computational complexity III: Higher type recurrence and elementary complexity.Daniel Leivant - 1999 - Annals of Pure and Applied Logic 96 (1-3):209-229.
    Download  
     
    Export citation  
     
    Bookmark   1 citation