✦ LIBER ✦

An Algorithm for Computing Minimal Coxian Representations

✍ Scribed by He, Q.-M.; Zhang, H.

Book ID: 115515235
Publisher: Operations Research Society of America
Year: 2008
Tongue: English
Weight: 205 KB
Volume: 20
Category: Article
ISSN: 0899-1499
DOI: 10.1287/ijoc.1070.0228

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for computing minimal curve

An algorithm for computing minimal curves

✍ Silvia Guarrera; Alessandro Logar; Emilia Mezzetti 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 513 KB

An Algorithm for Computing Minimal Bidir

An Algorithm for Computing Minimal Bidirectional Linear Recurrence Relations

✍ Salagean, A. 📂 Article 📅 2009 🏛 IEEE 🌐 English ⚖ 161 KB

An improved algorithm for computing Stei

An improved algorithm for computing Steiner minimal trees in Euclidean -space

✍ Marcia Fampa; Kurt M. Anstreicher 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 463 KB

An algorithm for computing a Padé approx

An algorithm for computing a Padé approximant with minimal degree denominator

✍ O.L. Ibryaeva; V.M. Adukov 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 262 KB

A polynomial algorithm for minimal inter

A polynomial algorithm for minimal interval representation

✍ Anat Fischer; Itzhak Gilboa; Moshe Shpitalni 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 929 KB

Polynomial time algorithms for computing

Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency

✍ Hans Kleine Büning; Xishun Zhao 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 72 KB

We say a propositional formula F in conjunctive normal form is represented by a formula H and a homomorphism φ, if φ(H ) = F . A homomorphism is a mapping consisting of a renaming and an identification of literals. The deficiency of a formula is the difference between the number of clauses and the n