✦ LIBER ✦

The Complexity of Counting Problems in Equational Matching

✍ Scribed by Miki Hermann; Phokion G. Kolaitis

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 805 KB
Volume: 20
Category: Article
ISSN: 0747-7171
DOI: 10.1006/jsco.1995.1054

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of matching with bonds

✍ Manfred Padberg; Antonio Sassano 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 549 KB

The complexity of counting graph homomor

The complexity of counting graph homomorphisms

✍ Martin Dyer; Catherine Greenhill 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 229 KB

On the Comparison Complexity of the Stri

On the Comparison Complexity of the String Prefix-Matching Problem

✍ Dany Breslauer; Livio Colussi; Laura Toniolo 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 525 KB

In this paper we study the exact comparison complexity of the string prefixmatching problem in the deterministic sequential comparison model with equality tests. We derive almost tight lower and upper bounds on the number of symbol comparisons required in the worst case by on-line prefix-matching al

A matching problem in the plane

✍ Mikhail J. Atallah 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 428 KB

The complexity of the tabulation of traj

The complexity of the tabulation of trajectory problems

✍ E.N. Gordeyev; V.K. Leont'ev 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 222 KB

The complexity of cyclic shop scheduling

The complexity of cyclic shop scheduling problems

✍ Nicholas G. Hall; Tae-Eog Lee; Marc E. Posner 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 190 KB

We consider scheduling problems for shops in which a job set is manufactured repetitively. Jobs are scheduled to minimize the cycle time of the job set, which is equivalent to maximizing the throughput rate. We characterize the complexity of the scheduling problem for several types of job shops. Pol