✦ LIBER ✦

Rational transductions and complexity of counting problems

✍ Scribed by C. Choffrut; M. Goldwurm

Publisher: Springer
Year: 1995
Tongue: English
Weight: 829 KB
Volume: 28
Category: Article
ISSN: 1433-0490
DOI: 10.1007/bf01185866

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Complexity of Counting Problems in E

The Complexity of Counting Problems in Equational Matching

✍ Miki Hermann; Phokion G. Kolaitis 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 805 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

The counting complexity of a simple sche

The counting complexity of a simple scheduling problem

✍ Gerardo Berbeglia 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 780 KB

Let T be a set of tasks. Each task has a non-negative processing time and a deadline. The problem of determining whether or not there is a schedule of the tasks in T such that a single machine can finish processing each of them before its deadline is polynomially solvable. We prove that counting the

Problems and possibilities of bremsstrah

Problems and possibilities of bremsstrahlung counting

✍ A. Spernol; E. De Roost; M. Mutterer 📂 Article 📅 1973 🏛 Elsevier Science ⚖ 884 KB

On the problem of rationality for some c

On the problem of rationality for some cubic complexes

✍ A. Alzati; M. Bertolini 📂 Article 📅 1988 🏛 Elsevier Science ⚖ 786 KB

Computational complexity of PERT problem

Computational complexity of PERT problems

✍ Jane N. Hagstrom 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 415 KB