3228 search results - page 222 / 646 » Computationally Sound Proofs |
161
click to vote
TCC
2009
Springer
16 years 7 months ago
2009
Springer
The concept of witness-hiding suggested by Feige and Shamir is a natural relaxation of zero-knowledge. In this paper we identify languages and distributions for which many known co...
176
click to vote
POPL
2010
ACM
16 years 4 months ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
186
click to vote
FMCAD
2006
Springer
15 years 10 months ago
2006
Springer
We describe a link between the ACL2 and HOL mechanical proof assistants that enables the strengths of each system to be deployed smoothly within a single formal development. Severa...
169
click to vote
IPPS
2003
IEEE
15 years 12 months ago
2003
IEEE
We describe Dynamic UNITY, a new formalism for the specification of dynamic distributed systems based on the UNITY formalism. This formalism allows for the specification and pro...
191
Voted
CIE
2010
Springer
15 years 11 months ago
2010
Springer
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...