1204 search results - page 84 / 241 » Termination of Polynomial Programs |
123
Voted
PLPV
2009
ACM
15 years 9 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
95
Voted
ICFP
2003
ACM
16 years 18 days ago
2003
ACM
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
113
click to vote
ICALP
2001
Springer
15 years 5 months ago
2001
Springer
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
94
Voted
CSFW
2008
IEEE
15 years 7 months ago
2008
IEEE
Zdancewic and Myers introduced observational determinism as a scheduler independent notion of security for concurrent programs. This paper proposes a type system for verifying obs...
ATMOS
2010
14 years 11 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...