8298 search results - page 78 / 1660 » On the Complexity of Numerical Analysis |
133
click to vote
DAGSTUHL
2008
15 years 7 months ago
2008
Abstract. We present algorithmic, complexity and implementation results concerning real root isolation of a polynomial of degree d, with integer coefficients of bit size , using S...
186
click to vote
COCO
1995
Springer
15 years 9 months ago
1995
Springer
For the worst-case complexity measure, if P = NP, then P = OptP, i.e., all NP optimization problems are polynomial-time solvable. On the other hand, it is not clear whether a simi...
185
click to vote
PPDP
2010
Springer
15 years 4 months ago
2010
Springer
Given a set of Datalog rules, facts, and a query, answers to the query can be inferred bottom-up starting with the facts or top-down starting with the query. For efficiently answe...
185
click to vote
ATAL
2009
Springer
16 years 22 days ago
2009
Springer
Coalition formation is a key topic in multi–agent systems (mas). Coalitions enable agents to achieve goals that they may not have been able to achieve independently, and encoura...
263
click to vote
POPL
2003
ACM
16 years 6 months 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...