Sciweavers

4352 search results - page 329 / 871
» A Representation Theorem and Applications
Sort
View
ECCC
2008
98views more  ECCC 2008»
15 years 7 months ago
Closed Timelike Curves Make Quantum and Classical Computing Equivalent
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
Scott Aaronson, John Watrous
ENTCS
2008
87views more  ENTCS 2008»
15 years 7 months ago
A Lightweight Approach for the Semantic Validation of Model Refinements
Model Driven Engineering proposes the use of models at different levels of ion. Step by step validation of model refinements is necessary to guarantee the correctness of the final ...
Claudia Pons, Diego García
IANDC
2008
120views more  IANDC 2008»
15 years 7 months ago
A framework for compositional verification of security protocols
Automatic security protocol analysis is currently feasible only for small protocols. Since larger protocols quite often are composed of many small protocols, compositional analysi...
Suzana Andova, Cas J. F. Cremers, Kristian Gj&osla...
CORR
2006
Springer
102views Education» more  CORR 2006»
15 years 7 months ago
A library of Taylor models for PVS automatic proof checker
We present in this paper a library to compute with Taylor models, a technique extending interval arithmetic to reduce decorrelation and to solve differential equations. Numerical s...
Francisco Cháves, Marc Daumas
CORR
2006
Springer
114views Education» more  CORR 2006»
15 years 7 months ago
A New Cryptosystem Based On Hidden Order Groups
Let G1 be a cyclic multiplicative group of order n. It is known that the Diffie-Hellman problem is random self-reducible in G1 with respect to a fixed generator g if (n) is known....
Amitabh Saxena, Ben Soh