✦ LIBER ✦

An algorithm to find a coordinate’s mate

✍ Scribed by Joost Berson; Arno van den Essen

Book ID: 104344854
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 175 KB
Volume: 36
Category: Article
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(03)00062-2

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper an algorithm is given to decide if a given polynomial in two variables with coefficients in a finitely generated K -algebra is a coordinate and if so, find a mate for this polynomial.

📜 SIMILAR VOLUMES

An algorithm to find agreement subtrees

✍ Ewa Kubicka; Grzegorz Kubicki; F. R. McMorris 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 339 KB

An algorithm to find polygon similarity

✍ Jayaramaiah Boreddy; R.N. Mukherjee 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 191 KB

A Polynomial-Time Algorithm to Find von

✍ Jun Wako 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 700 KB

An algorithm to find an element of the c

An algorithm to find an element of the conjugate cone

✍ I. V. Konnov; R. F. Khabibullin 📂 Article 📅 1988 🏛 Springer US 🌐 English ⚖ 300 KB

An efficient algorithm to find next-to-s

An efficient algorithm to find next-to-shortest path on

✍ Sambhu Charan Barman; Sukumar Mondal; Madhumangal Pal 📂 Article 📅 2008 🏛 Springer-Verlag 🌐 English ⚖ 354 KB

An efficient algorithm to find optimal d

An efficient algorithm to find optimal double loop networks

✍ F. Aguiló; M.A. Fiol 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 527 KB

The problem of finding optimal diameter double loop networks with a fixed number of vertices has been widely studied. In this work, we give an algorithmic solution of the problem by using a geometrical approach. Given a fixed number of vertices n, the general problem is to find "steps" s 1 , s z e