420 search results - page 11 / 84 » Some Algorithmic Problems in Polytope Theory |
STOC
2002
ACM
15 years 10 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We propose a new quantifier elimination algorithm for the theory of linear real arithmetic. This algorithm uses as subroutines satisfiability modulo this theory and polyhedral pro...
WEA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
SAC
2010
ACM
15 years 4 months ago
2010
ACM
Analysis of systems containing both discrete and continuous dynamics, hybrid systems, is a difficult issue. Most problems have been shown to be undecidable in general, and decidab...
100
click to vote
SAGT
2010
Springer
14 years 8 months ago
2010
Springer
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...