Sciweavers

233 search results - page 15 / 47
» Interactive Proofs For Quantum Computations
Sort
View
ENTCS
2007
121views more  ENTCS 2007»
14 years 11 months ago
Dagger Compact Closed Categories and Completely Positive Maps: (Extended Abstract)
ly positive maps (extended abstract) Peter Selinger 1 Department of Mathematics and Statistics Dalhousie University, Halifax, Nova Scotia, Canada Dagger compact closed categories ...
Peter Selinger
EUROCRYPT
2008
Springer
15 years 1 months ago
New Constructions for UC Secure Computation Using Tamper-Proof Hardware
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...
Nishanth Chandran, Vipul Goyal, Amit Sahai
CSL
2010
Springer
15 years 25 days ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
ICCSA
2005
Springer
15 years 5 months ago
High-Level Quantum Chemical Methods for the Study of Photochemical Processes
Multireference configuration interaction calculations have been performed on the excited state energy surfaces of the methyleneimmonium cation using recently developed methods for ...
Hans Lischka, Adélia J. A. Aquino, Mario Ba...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 5 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen