6978 search results - page 268 / 1396 » On Proofs in System P |
166
click to vote
IEEESCC
2008
IEEE
16 years 1 months ago
2008
IEEE
—This paper presents a novel approach to model a complex evolving system, a Digital Business Ecosystem (DBE) that takes the specific needs of Small and Medium-sized Enterprises ...
177
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
165
click to vote
HICSS
2008
IEEE
16 years 1 months ago
2008
IEEE
Many peer-to-peer (P2P) networks have been widely used for file sharing. A peer acts both as a content provider and a consumer, and is granted autonomy to decide what content, wit...
193
click to vote
EUROCRYPT
2004
Springer
16 years 1 days ago
2004
Springer
Informally, an obfuscator O is an efficient, probabilistic “compiler” that transforms a program P into a new program O(P) with the same functionality as P, but such that O(P)...
143
click to vote
FSTTCS
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. We present a natural confluence of higher-order hereditary Harrop formulas (HH formulas), Constraint Logic Programming (CLP, [JL87]), and Concurrent Constraint Programmi...