"First-order queries on structures of bounded degree are computable with ..."

Arnaud Durand, Etienne Grandjean (2007)

> Home

Details and statistics

DOI: 10.1145/1276920.1276923

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tocl/DurandG07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tocl/DurandG07
Arnaud Durand, Etienne Grandjean:
First-order queries on structures of bounded degree are computable with constant delay. ACM Trans. Comput. Log. 8(4): 21 (2007)

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.