14 search results - page 2 / 3 » Strict polynomial-time in simulation and extraction |
PADS
2004
ACM
13 years 10 months ago
2004
ACM
We investigated the benefit of exploiting the symmetries of graphs for partitioning. We represent the model to be simulated by a weighted graph. Graph symmetries are studied in th...
ECAI
2010
Springer
13 years 6 months ago
2010
Springer
Landmarks for a planning problem are subgoals that are necessarily made true at some point in the execution of any plan. Since verifying that a fact is a landmark is PSPACE-complet...
EUROCRYPT
2003
Springer
13 years 10 months ago
2003
Springer
A new public-key model for resettable zero-knowledge (rZK) protocols, which is an extension and generalization of the upper-bounded public-key (UPK) model introduced by Micali and ...
INFOCOM
2009
IEEE
13 years 12 months ago
2009
IEEE
—Greedy routing is a novel routing paradigm where messages are always forwarded to the neighbor that is closest to the destination. Our main result is a polynomial-time algorithm...
QEST
2007
IEEE
13 years 11 months ago
2007
IEEE
We investigate logics and equivalence relations that capture the qualitative behavior of Markov Decision Processes (MDPs). We present Qualitative Randomized Ctl (Qrctl): formulas o...