✦ LIBER ✦

An O(n2) Algorithm for the Characteristic Polynomial of a Tree

✍ Scribed by David P. Jacobs; Catia M.S. Machado; Vilmar Trevisan

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing the characteristic polynomial

✍ G. Tinhofer; H. Schreck 📂 Article 📅 1985 🏛 Springer Vienna 🌐 English ⚖ 544 KB

Computing the characteristic polynomial

✍ Bojan Mohar 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 170 KB

An O (n2) heuristic algorithm for the di

✍ J.MacGregor Smith; Judith S. Liebman 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 827 KB

An O(n2) simplex algorithm for a class o

✍ H. Schreck; G. Tinhofer 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 779 KB

An $O ( ( n\log p )^2 )$ Algorithm for t

✍ Chandrasekaran, R.; Tamir, A. 📂 Article 📅 1980 🏛 Society for Industrial and Applied Mathematics ⚖ 776 KB

A randomized algorithm for finding maxim

✍ Hing F. Ting; Andrew C. Yao 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 410 KB