Sciweavers

3228 search results - page 207 / 646
» Computationally Sound Proofs
Sort
View
LICS
2008
IEEE
16 years 29 days ago
Focusing on Binding and Computation
Variable binding is a prevalent feature of the syntax and proof theory of many logical systems. In this paper, we define a programming language that provides intrinsic support fo...
Daniel R. Licata, Noam Zeilberger, Robert Harper
CIE
2005
Springer
16 years 3 days ago
Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...
George Barmpalias
CRYPTO
2010
Springer
167views Cryptology» more  CRYPTO 2010»
15 years 7 months ago
Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost
Multiparty computation protocols have been known for more than twenty years now, but due to their lack of efficiency their use is still limited in real-world applications: the goal...
Ivan Damgård, Claudio Orlandi
CORR
2004
Springer
94views Education» more  CORR 2004»
15 years 6 months ago
Quantum Computing, Postselection, and Probabilistic Polynomial-Time
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
Scott Aaronson
ISWC
2002
IEEE
15 years 11 months ago
Minimal Social Weight User Interactions for Wearable Computers in Business Suits
This paper presents the e-SUIT, a wearable computer incorporated in a traditional business suit. A key feature of the system is an array of input/output devices integrated into th...
Aaron Toney, Barrie Mulley, Bruce H. Thomas, Wayne...