"Efficient Algorithms for Computing Modulo Permutation Theories."

Jürgen Avenhaus (2004)

> Home

Details and statistics

DOI: 10.1007/978-3-540-25984-8_31

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cade/Avenhaus04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cade/Avenhaus04
Jürgen Avenhaus:
Efficient Algorithms for Computing Modulo Permutation Theories. IJCAR 2004: 415-429

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.