237 search results - page 26 / 48 » On the decidability and complexity of reasoning about only k... |
CONCUR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In the quest for tractable methods for reasoning about concurrent algorithms both rely/guarantee logic and separation logic have made great advances. They both seek to ta...
FUIN
2000
13 years 7 months ago
2000
The nondeterministic information logic NIL has been introduced by Orlowska and Pawlak in 1984 as a logic for reasoning about total information systems with the similarity, the forw...
ASIACRYPT
2005
Springer
14 years 28 days ago
2005
Springer
Abstract. A two-argument function is computed privately by two parties if after the computation, no party should know anything about the other inputs except for what he is able to ...
TGIS
2008
13 years 7 months ago
2008
Assessing spatial scenes for similarity is difficult from a cognitive and computational perspective. Solutions to spatial-scene similarity assessments are sensible only if corresp...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...