2233 search results - page 104 / 447 » On the Complexity of Theory Curbing |
173
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
190
click to vote
EM
2010
15 years 6 months ago
2010
In this paper we enumerate and classify the "simplest" pairs (M, G) where M is a closed orientable 3-manifold and G is a trivalent graph embedded in M. To enumerate the p...
188
click to vote
CIE
2007
Springer
16 years 15 days ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....
197
click to vote
FUN
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
173
click to vote
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...