𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Polynomial-time algorithm for fixed points of nontrivial morphisms

✍ Scribed by Štěpán Holub

Book ID
108114135
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
628 KB
Volume
309
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polynomial time algorithms for three-lab
Polynomial time algorithms for three-label point labeling
✍ Rob Duncan; Jianbo Qian; Antoine Vigneron; Binhai Zhu 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 155 KB

In this paper, we present an O(n 2 log n) time solution for the following multi-label map labeling problem: given a set S of n distinct sites in the plane, place at each site a triple of uniform squares of maximum possible size such that all the squares are axis-parallel and a site is on the boundar

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