"Expressibility of Bounded-Arity Fixed-Point Query Hierarchies."

Pratul Dublish, S. N. Maheshwari (1989)

> Home

Details and statistics

DOI: 10.1145/73721.73753

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/pods/DublishM89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pods/DublishM89
Pratul Dublish, S. N. Maheshwari:
Expressibility of Bounded-Arity Fixed-Point Query Hierarchies. PODS 1989: 324-335

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.