3172 search results - page 64 / 635 » On the Random-Self-Reducibility of Complete Sets |
106
click to vote
MAGS
2006
15 years 21 days ago
2006
In this paper, a novel protocol for providing both client and server anonymity in peer-to-peer (P2P) based grids is presented. The protocol assumes individual nodes or users to be...
97
Voted
VL
2007
IEEE
15 years 7 months ago
2007
IEEE
Description logics (DLs) are a well-understood family of knowledge representation (KR) languages. The notation of DLs has the flavour of a variable-free first order predicate lo...
98
Voted
SAT
2004
Springer
15 years 6 months ago
2004
Springer
We define a collection of mappings that transform many-valued clausal forms into satisfiability equivalent Boolean clausal forms, analyze their complexity and evaluate them empir...
COCO
2001
Springer
15 years 5 months ago
2001
Springer
We use hypotheses of structural complexity theory to separate various NP-completeness notions. In particular, we introduce an hypothesis from which we describe a set in NP that is...
105
click to vote
JUCS
2010
14 years 11 months ago
2010
: We introduce a first-order temporal logic for reasoning about branching time. It is well known that the set of valid formulas is not recursively enumerable and there is no fini...