Publication | Closed Access
A complete proof of correctness of the Knuth-Bendix completion algorithm
180
Citations
4
References
1981
Year
Mathematical ProgrammingComputational Complexity TheoryEngineeringComplete ProofProof ComplexityAlgorithmic Information TheoryComputational ComplexityTime ComplexityP Versus Np ProblemComputer ScienceDiscrete MathematicsCombinatorial Optimization
| Year | Citations | |
|---|---|---|
Page 1
Page 1