1204 search results - page 82 / 241 » Termination of Polynomial Programs |
106
Voted
LOPSTR
2009
Springer
15 years 7 months ago
2009
Springer
Proving termination of, or generating efficient control for Constraint Handling Rules (CHR) programs requires information about the kinds of constraints that can show up in the CHR...
110
Voted
ICALP
2009
Springer
16 years 28 days ago
2009
Springer
We show several unconditional lower bounds for exponential time classes against polynomial time classes with advice, including:
101
Voted
ECOOP
2005
Springer
15 years 6 months ago
2005
Springer
There are many algorithms for concurrent garbage collection, but they are complex to describe, verify, and implement. This has resulted in a poor understanding of the relationships...
101
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...
109
click to vote
POPL
2004
ACM
15 years 6 months ago
2004
ACM
The ability to summarize procedures is fundamental to building scalable interprocedural analyses. For sequential programs, procedure summarization is well-understood and used rout...