1242 search results - page 75 / 249 » A Computational Complexity Theory in Membrane Computing |
162
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
In the early 1920s, Pavel Urysohn proved his famous lemma (sometimes referred to as "first non-trivial result of point set topology"). Among other applications, this lemm...
167
click to vote
ISSAC
1997
Springer
15 years 10 months ago
1997
Springer
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
166
click to vote
ATAL
2003
Springer
15 years 11 months ago
2003
Springer
A team of agents planning to perform a complex task make a number of interrelated decisions as they determine precisely how that complex task will be performed. The decision set i...
177
click to vote
ATAL
2006
Springer
15 years 9 months ago
2006
Springer
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
166
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...