3228 search results - page 256 / 646 » Computationally Sound Proofs |
124
click to vote
ISMVL
1994
IEEE
15 years 8 months ago
1994
IEEE
The problem of approximating a propositional calculus is to nd many-valued logics which are sound for the calculus (i.e., all theorems of the calculus are tautologies) with as few...
108
click to vote
CG
2006
Springer
15 years 6 months ago
2006
Springer
In this paper we explore the tactical aspects needed for the creation of an intelligent computer-pool player. The research results in three modifications to our previous model. An ...
FECS
2007
15 years 6 months ago
2007
In this paper, we describe assessment processes at three computer science programs accredited by the Computing Accreditation Commission (CAC) of ABET. Assessment is a vital compon...
156
click to vote
ASIACRYPT
2009
Springer
15 years 11 months ago
2009
Springer
At Eurocrypt 2009 Aggarwal and Maurer proved that breaking RSA is equivalent to factoring in the generic ring model. This model captures algorithms that may exploit the full algeb...
129
Voted
CCR
2000
15 years 4 months ago
2000
We propose a zero-knowledge interactive proof based identification and signature scheme. The protocol is based on Euler's totient function and discrete logarithms over the ri...