Sciweavers

1011 search results - page 168 / 203
» The three dimensions of proofs
Sort
View
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
15 years 11 months ago
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
Andris Ambainis, Ke Yang
RTA
2004
Springer
15 years 11 months ago
Rewriting for Fitch Style Natural Deductions
Logical systems in natural deduction style are usually presented in the Gentzen style. A different definition of natural deduction, that corresponds more closely to proofs in ord...
Herman Geuvers, Rob Nederpelt
EUROCRYPT
2003
Springer
15 years 11 months ago
A Framework for Password-Based Authenticated Key Exchange
Abstract. In this paper we present a general framework for passwordbased authenticated key exchange protocols, in the common reference odel. Our protocol is actually an abstraction...
Rosario Gennaro, Yehuda Lindell
DATE
2010
IEEE
126views Hardware» more  DATE 2010»
15 years 11 months ago
Leveraging dominators for preprocessing QBF
— Many CAD for VLSI problems can be naturally encoded as Quantified Boolean Formulas (QBFs) and solved with QBF solvers. Furthermore, such problems often contain circuitbased in...
Hratch Mangassarian, Bao Le, Alexandra Goultiaeva,...
ICALP
2010
Springer
15 years 11 months ago
Probabilistic Automata on Finite Words: Decidable and Undecidable Problems
Abstract. This paper tackles three algorithmic problems for probabilistic automata on finite words: the Emptiness Problem, the Isolation Problem and the Value 1 Problem. The Empti...
Hugo Gimbert, Youssouf Oualhadj