Sciweavers

3228 search results - page 138 / 646
» Computationally Sound Proofs
Sort
View
DAC
2007
ACM
14 years 11 months ago
On Resolution Proofs for Combinational Equivalence
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...
CRYPTO
2008
Springer
134views Cryptology» more  CRYPTO 2008»
13 years 12 months ago
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
We construct noninteractive statistical zero-knowledge (NISZK) proof systems for a variety of standard approximation problems on lattices, such as the shortest independent vectors...
Chris Peikert, Vinod Vaikuntanathan
COMPGEOM
2009
ACM
14 years 4 months ago
Approximate center points with proofs
We present the Iterated-Tverberg algorithm, the first deterministic algorithm for computing an approximate centerpoint of a set S ∈ Rd with running time sub-exponential in d. T...
Gary L. Miller, Donald Sheehy
RTA
2005
Springer
14 years 3 months ago
Proof-Producing Congruence Closure
Many applications of congruence closure nowadays require the ability of recovering, among the thousands of input equations, the small subset that caused the equivalence of a given ...
Robert Nieuwenhuis, Albert Oliveras
NIPS
2004
13 years 11 months ago
Using Machine Learning to Break Visual Human Interaction Proofs (HIPs)
Machine learning is often used to automatically solve human tasks. In this paper, we look for tasks where machine learning algorithms are not as good as humans with the hope of ga...
Kumar Chellapilla, Patrice Y. Simard