Sciweavers

12 search results - page 3 / 3
» ictcs 2003
Sort
View
93
Voted
ICTCS
2003
Springer
15 years 2 months ago
On the Computational Complexity of Cut-Elimination in Linear Logic
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cut-elimination problem (CEP) is to decide whether these proofs reduce to the same no...
Harry G. Mairson, Kazushige Terui
78
Voted
ICTCS
2003
Springer
15 years 2 months ago
Cost Constrained Fixed Job Scheduling
In this paper, we study the problem of cost constrained fixed job scheduling (CCFJS). In this problem, there are a number of processors, each of which belongs to one of several cla...
Qiwei Huang, Errol L. Lloyd