6978 search results - page 131 / 1396 » On Proofs in System P |
188
click to vote
CCGRID
2003
IEEE
15 years 11 months ago
2003
IEEE
In this paper, we present DKS(N, k, f), a family of infrastructures for building Peer-To-Peer applications. Each instance of DKS(N, k, f) is a fully decentralized overlay network ...
176
click to vote
EDBT
2009
ACM
15 years 10 months ago
2009
ACM
Many websites with a large user base, e.g., websites of nonprofit organizations, do not have the financial means to install large web-servers or use specialized content distributi...
152
click to vote
STOC
1994
ACM
15 years 10 months ago
1994
ACM
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandomnumber generators do not exist. This famous result is ...
148
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
We prove that n+h 4 vertex guards are always sufficient to see the entire interior of an n-vertex orthogonal polygon P with an arbitrary number h of holes provided that there exis...
BSL
2007
15 years 6 months ago
2007
We introduce a nonstandard arithmetic NQA− based on the theory developed by R. Chuaqui and P. Suppes in [2] (we will denote it by NQA+ ), with a weakened external open minimizati...