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

Pratul Dublish, S. N. Maheshwari (1989)

Details and statistics

DOI: 10.1145/73721.73753

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-06

a service of  Schloss Dagstuhl - Leibniz Center for Informatics