20 search results - page 3 / 4 » The Complexity of Semilinear Problems in Succinct Representa... |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
It is well-known that modal satisfiability is PSPACE-complete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there ...
STOC
2010
ACM
14 years 6 days ago
2010
ACM
We propose a new framework for discussing computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represente...
ATAL
2009
Springer
14 years 1 months ago
2009
Springer
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be ...
ECCV
2010
Springer
13 years 5 months ago
2010
Springer
Visual tracking is one of the central problems in computer vision. A crucial problem of tracking is how to represent the object. Traditional appearance-based trackers are using inc...
SP
2008
IEEE
14 years 1 months ago
2008
IEEE
Automata-based representations and related algorithms have been applied to address several problems in information security, and often the automata had to be augmented with additi...