6978 search results - page 217 / 1396 » On Proofs in System P |
192
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
We find the number of partitions of n whose BG-rank is j, in terms of pp(n), the number of pairs of partitions whose total number of cells is n, giving both bijective and generati...
159
click to vote
JSYML
2010
15 years 1 months ago
2010
In this paper, we introduce the systems ns-ACA0 and ns-WKL0 of non-standard second-order arithmetic in which we can formalize non-standard arguments in ACA0 and WKL0, respectively...
160
click to vote
ACNS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. In 2008, Groth and Sahai proposed a general methodology for constructing non-interactive zeroknowledge (and witness-indistinguishable) proofs in bilinear groups. While av...
150
click to vote
ICC
2007
IEEE
16 years 27 days ago
2007
IEEE
—When constructing an unstructured P2P topology, one should consider the application running on top of it in order to achieve a good performance for the whole P2P system. It is n...
203
click to vote
NOSSDAV
2005
Springer
16 years 2 days ago
2005
Springer
P2P systems inherently have high scalability, robustness and fault tolerance because there is no centralized server and the network self-organizes itself. This is achieved at the ...