13603 search results - page 153 / 2721 » On the Computational Complexity of Cut-Reduction |
136
click to vote
IANDC
2007
15 years 6 months ago
2007
ectly-synchronized round-based model provides the powerful abstraction of op failures with atomic and synchronous message delivery. This abstraction makes distributed programming ...
179
click to vote
TCS
2008
15 years 6 months ago
2008
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
191
click to vote
KR
2010
Springer
15 years 10 months ago
2010
Springer
We investigate the computational complexity of axiom pinpointing, which is the task of finding minimal subsets of a Description Logic knowledge base that have a given consequence...
162
click to vote
EWCBR
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we present TransUCP, a general framework for transformational analogy. Using our framework we demonstrate that transformational analogy does not meet a crucial condit...
151
Voted
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
We analyze the complexity of equilibria problems for a class of strategic zero-sum games, called Angel-Daemon games. Those games were introduced to asses the goodness of a web or g...