𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A polynomial time algorithm to detect PQI interval orders

✍ Scribed by An Ngo The; Alexis Tsoukiàs; Philippe Vincke

Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
176 KB
Volume
7
Category
Article
ISSN
0969-6016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Probabilistic Algorithm to Test Local
A Probabilistic Algorithm to Test Local Algebraic Observability in Polynomial Time
✍ Alexandre Sedoglavic 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 395 KB

The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the input-output behaviour of an experiment? How many of the remaining variables should we assume to be known in order to determ

A polynomial time algorithm for rectilin
A polynomial time algorithm for rectilinear Steiner trees with terminals constrained to curves
✍ Brazil, M.; Thomas, D. A.; Weng, J. F. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB 👁 2 views

The rectilinear Steiner problem is the problem of constructing the shortest rectilinear network in the plane connecting a given set of points, called terminals. The problem is known to be NP-complete in general. In this paper, we show that there is a polynomial time algorithm for solving the rectili

Polynomial Time Algorithms to Approximat
Polynomial Time Algorithms to Approximate Permanents and Mixed Discriminants Within a Simply Exponential Factor
✍ Alexander Barvinok 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 308 KB

We present real, complex, and quaternionic versions of a simple randomized polynomial time algorithm to approximate the permanent of a nonnegative matrix and, more generally, the mixed discriminant of positive semidefinite matrices. The algorithm provides an unbiased estimator, which, with high prob