3333 search results - page 60 / 667 » Abstract Proof Search |
119
click to vote
MFCS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
161
Voted
MFCS
1994
Springer
15 years 6 months ago
1994
Springer
We introduce in this paper new communication and synchronization constructs which allow deterministic processes, communicating asynchronously via unbounded FIFO bu ers, to cope wi...
95
Voted
CIE
2008
Springer
15 years 4 months ago
2008
Springer
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
140
click to vote
FC
2008
Springer
15 years 4 months ago
2008
Springer
Abstract. The banking industry in Norway has developed a new security infrastructure for conducting commerce on the Internet. The initiative, called BankID, aims to become a nation...
136
Voted
ENTCS
2007
15 years 2 months ago
2007
ion and Completeness for Real-Time Maude Peter Csaba ¨Olveczky a,b and Jos´e Meseguer b a Department of Informatics, University of Oslo b Department of Computer Science, Universi...