"Alternation and the Computational Complexity of Logic Programs."

Ehud Y. Shapiro (1982)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2013-11-29

- no documents available
- export record
  dblp key:
  - conf/iclp/Shapiro82
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iclp/Shapiro82
Ehud Y. Shapiro:
Alternation and the Computational Complexity of Logic Programs. ICLP 1982: 154-163

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.