Sciweavers

118 search results - page 17 / 24
» A Simple Proof of Miller-Yu Theorem
Sort
View
ENTCS
2008
90views more  ENTCS 2008»
14 years 9 months ago
Ensuring the Correctness of Lightweight Tactics for JavaCard Dynamic Logic
The interactive theorem prover developed in the KeY project, which implements a sequent calculus for JavaCard Dynamic Logic (JavaCardDL) is based on taclets. Taclets are lightweig...
Richard Bubel, Andreas Roth, Philipp Rümmer
86
Voted
ENTCS
2008
94views more  ENTCS 2008»
14 years 9 months ago
A Formal Model of Memory Peculiarities for the Verification of Low-Level Operating-System Code
This paper presents our solutions to some problems we encountered in an ongoing attempt to verify the micro-hypervisor currently developed within the Robin project. The problems t...
Hendrik Tews, Tjark Weber, Marcus Völp
CORR
2004
Springer
94views Education» more  CORR 2004»
14 years 9 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
73
Voted
DM
2008
83views more  DM 2008»
14 years 9 months ago
The polynomial degrees of Grassmann and Segre varieties over GF(2)
A recent proof that the Grassmannian G1;n;2 of lines of PG(n; 2) has polynomial degree n 2 1 is outlined, and is shown to yield a theorem about certain kinds of subgraphs of any (...
R. Shaw
CORR
2006
Springer
77views Education» more  CORR 2006»
14 years 9 months ago
Generalized Entropy Power Inequalities and Monotonicity Properties of Information
New families of Fisher information and entropy power inequalities for sums of independent random variables are presented. These inequalities relate the information in the sum of n ...
Mokshay M. Madiman, Andrew R. Barron