"Reducing the Complexity of the Knuth-Bendix Completion-Algorithm: A ..."

Franz Winkler (1985)

> Home

Details and statistics

DOI: 10.1007/3-540-15984-3_293

access: closed

type: Conference or Workshop Paper

metadata version: 2019-03-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/eurocal/Winkler85
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/eurocal/Winkler85
Franz Winkler:
Reducing the Complexity of the Knuth-Bendix Completion-Algorithm: A "Unification" of Different Approaches. European Conference on Computer Algebra (2) 1985: 378-389

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.