19700 search results - page 3688 / 3940 » DNA-Based Computation Times |
163
click to vote
COCO
2004
Springer
16 years 3 days ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
163
click to vote
DRM
2004
Springer
16 years 2 days ago
2004
Springer
The current landscape for digital rights management (DRM) consists of various ad hoc technologies and platforms that largely focus on copy protection. The fragmented nature of the...
152
click to vote
GI
2004
Springer
16 years 2 days ago
2004
Springer
: The article provides an overview of the legal relationships in Open Source Structures. It shows that – as within all software development and distribution models – different ...
160
click to vote
ICALP
2004
Springer
16 years 2 days ago
2004
Springer
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...
195
click to vote
ICS
2004
Tsinghua U.
16 years 2 days ago
2004
Tsinghua U.
We propose a novel replacement algorithm, called InterReference Gap Distribution Replacement (IGDR), for setassociative secondary caches of processors. IGDR attaches a weight to e...