451 search results - page 11 / 91 » On Parameterized Exponential Time Complexity |
BIRTHDAY
2010
Springer
13 years 7 months ago
2010
Springer
In [7] Nash, Remmel, and Vianu have raised the question whether a logic L, already introduced by Gurevich in 1988, captures polynomial time, and they give a reformulation of this ...
ATAL
2010
Springer
13 years 11 months ago
2010
Springer
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...
FTCGV
2006
13 years 9 months ago
2006
We present a survey of recent methods for creating piecewise linear mappings between triangulations in 3D and simpler domains such as planar regions, simplicial complexes, and sph...
TVCG
2008
13 years 9 months ago
2008
We present a novel postprocessing utility called adaptive geometry image (AGIM) for global parameterization techniques that can embed a 3D surface onto a rectangular1 domain. This ...
VMCAI
2010
Springer
14 years 7 months ago
2010
Springer
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...