"The Complexity of Monadic Recursion Schemes: Exponential Time Bounds."

Harry B. Hunt III, Daniel J. Rosenkrantz (1984)

> Home

Details and statistics

DOI: 10.1016/0022-0000(84)90021-7

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jcss/HuntR84
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/HuntR84
Harry B. Hunt III, Daniel J. Rosenkrantz:
The Complexity of Monadic Recursion Schemes: Exponential Time Bounds. J. Comput. Syst. Sci. 28(3): 395-419 (1984)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.