✦ LIBER ✦

An upper bound on the derivational complexity of Knuth–Bendix orderings

✍ Scribed by Dieter Hofbauer

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Upper bound on the derivational complexi

✍ S. I. Adian 📂 Article 📅 2009 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 190 KB

An upper bound on the “dimension of inte

✍ I Rabinovitch 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 196 KB

An upper bound on the time complexity of

✍ Brian G. Patrick; Mohammed Almulla; Monroe M. Newborn 📂 Article 📅 1992 🏛 Springer Netherlands 🌐 English ⚖ 704 KB

An upper bound for the complexity of tra

✍ Stuart W Margolis; Bret Tilson 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 759 KB

A new upper bound on the complexity of d

✍ H.T. Kung 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 341 KB

Dehn surgeries on the figure eight knot:

✍ E. A. Fominykh 📂 Article 📅 2011 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 206 KB