6978 search results - page 2 / 1396 » On Proofs in System P |
EDBT
2008
ACM
14 years 7 months ago
2008
ACM
Structured P2P systems have been developed for constructing applications at internet scale in cooperative environments and exhibit a number of desirable features such as scalabili...
FOCS
1990
IEEE
13 years 11 months ago
1990
IEEE
A new algebraic technique for the construction of interactive proof systems is presented. Our technique is used to prove that every language in the polynomial-time hierarchy has an...
COLCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract. Existing Peer to Peer (P2P) collaborative editing systems do not allow any user to undo any modification. However, in such systems, users are not aware of others’ modi...
DEXAW
2006
IEEE
14 years 1 months ago
2006
IEEE
A significant challenge for Peer-to-Peer (P2P) systems is maintaining the correctness and consistency of their global data structures and shared contents as peers independently a...
TAMC
2010
Springer
14 years 18 days ago
2010
Springer
Unless we resolve the P vs NP question, we are unable to say whether there is an algorithm (acceptor) that accepts Boolean tautologies in polynomial time and does not accept non-ta...