8824 search results - page 154 / 1765 » On the Complexity of Real Functions |
138
click to vote
JC
2000
15 years 4 months ago
2000
Deciding efficiently the emptiness of a real algebraic set defined by a single equation is a fundamental problem of computational real algebraic geometry. We propose an algorithm ...
244
Voted
CP
2009
Springer
16 years 5 months ago
2009
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
124
click to vote
CADE
2009
Springer
16 years 5 months ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
152
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
Strategic games may exhibit symmetries in a variety of ways. A characteristic feature, enabling the compact representation of games even when the number of players is unbounded, i...
124
Voted
CIE
2005
Springer
15 years 10 months ago
2005
Springer
1 and 2, and in the last Section 4 of this abstract I will outline very briefly some conclusions about recursion and complexity which I believe that they support. 1 Partial Algebr...