𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A dichotomy in the complexity of counting database repairs

✍ Scribed by Maslowski, Dany; Wijsen, Jef

Book ID
120315296
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
486 KB
Volume
79
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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