10890 search results - page 58 / 2178 » Automatic Complexity Analysis |
187
Voted
POPL
2003
ACM
16 years 25 days ago
2003
ACM
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
99
Voted
COCO
2006
Springer
15 years 4 months ago
2006
Springer
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis. We show that both hinge on the question of understanding the...
114
click to vote
MP
2011
14 years 7 months ago
2011
We perform a smoothed analysis of Renegar’s condition number for linear programming by analyzing the distribution of the distance to ill-posedness of a linear program subject to...
105
Voted
CSCLP
2005
Springer
15 years 6 months ago
2005
Springer
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...
123
Voted
INFORMATICALT
2010
14 years 11 months ago
2010
The genetic information in cells is stored in DNA sequences, represented by a string of four letters, each corresponding to a definite type of nucleotides. Genomic DNA sequences a...