Sciweavers

3228 search results - page 116 / 646
» Computationally Sound Proofs
Sort
View
FOCS
1992
IEEE
14 years 2 months ago
Probabilistic Checking of Proofs; A New Characterization of NP
We give a new characterization of NP: the class NP contains exactly those languages L for which membership proofs (a proof that an input x is in L) can be verified probabilisticall...
Sanjeev Arora, Shmuel Safra
ACMACE
2010
ACM
13 years 5 months ago
Concert viewing headphones
Concert Viewing Headphones, which are equipped with a projector, an inclination sensor, and a distance sensor for zoom control, have been developed. These headphones enable a user...
Sawako Miyashita, Masatoshi Hamanaka, SeungHee Lee
LICS
2008
IEEE
14 years 4 months ago
Correctness of Multiplicative Additive Proof Structures is NL-Complete
We revisit the correctness criterion for the multiplicative additive fragment of linear logic. We prove that deciding the correctness of corresponding proof structures is NLcomple...
Paulin Jacobé de Naurois, Virgile Mogbil
JIIS
2008
104views more  JIIS 2008»
13 years 10 months ago
A framework for checking proofs naturally
We propose a natural framework, called NF, which supports development of formal proofs on a computer. NF is based on a theory of Judgments and Derivations. NF is designed by observ...
Masahiko Sato
TCC
2010
Springer
188views Cryptology» more  TCC 2010»
14 years 5 months ago
Founding Cryptography on Tamper-Proof Hardware Tokens
A number of works have investigated using tamper-proof hardware tokens as tools to achieve a variety of cryptographic tasks. In particular, Goldreich and Ostrovsky considered the ...
Vipul Goyal, Yuval Ishai, Amit Sahai, Ramarathnam ...