✦ LIBER ✦

VLSI Routing in Polynomial Time

✍ Scribed by András Recski

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 218 KB
Volume: 5
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(05)80184-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

River routing in VLSI

✍ Andranik Mirzaian 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 773 KB

Dynamic multicast routing in VLSI

✍ L.S Kei; T Srikanthan 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 269 KB

As real-time applications requiring dynamic group communication emerges, existing multicast routing algorithms must be improved to cater for high-speed routing decisions. Most of the reported efficient multicast routing algorithms for real-time applications construct a multicast tree using the Dijks

A polynomial-time algorithm for message

A polynomial-time algorithm for message routing in hierarchical communication networks

✍ George G. Polak; Ravindra K. Ahuja 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 456 KB

A polynomial-time optimization algorithm

A polynomial-time optimization algorithm for a rectilinear partitioning problem with applications in VLSI design automation

✍ Maharaj Mukherjee; Kanad Chakraborty 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 102 KB

Computing power series in polynomial tim

Computing power series in polynomial time

✍ Ker-I Ko; Harvey Friedman 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 535 KB

Reasoning about action in polynomial tim

Reasoning about action in polynomial time

✍ Thomas Drakengren; Marcus Bjäreland 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 196 KB

Although many formalisms for reasoning about action exist, surprisingly few approaches have taken computational complexity into consideration. The contributions of this article are the following: a temporal logic with a restriction for which deciding satisfiability is tractable, a tractable extensio