8196 search results - page 111 / 1640 » Computational Modeling and Complexity Science |
EOR
2008
14 years 10 months ago
2008
We review complexity results for minimizing polynomials over the standard simplex and unit hypercube. In addition, we derive new results on the computational complexity of approxi...
STOC
1992
ACM
15 years 1 months ago
1992
ACM
Paul Beame Joan Lawry Department of Computer Science and Engineering, FR-35 University of Washington Seattle, Washington 98195 Our main result is the demonstration of a Boolean fu...
SPIN
2004
Springer
15 years 3 months ago
2004
Springer
Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution
LATIN
1998
Springer
15 years 2 months ago
1998
Springer
The reconstruction of a shape or surface from a finite set of points is a practically significant and theoretically challenging problem. This paper presents a unified view of algor...
ICALP
2009
Springer
15 years 10 months ago
2009
Springer
Negation-limited circuits have been studied as a circuit model between general circuits and monotone circuits. In this paper, we consider limiting negations in formulas. The minimu...