3228 search results - page 496 / 646 » Computationally Sound Proofs |
123
Voted
CTRSA
2010
Springer
15 years 6 months ago
2010
Springer
This paper presents a new identity based key agreement protocol. In id-based cryptography (introduced by Adi Shamir in [33]) each party uses its own identity as public key and rece...
122
click to vote
BIRTHDAY
2010
Springer
15 years 4 months ago
2010
Springer
One of the obstacles in automatic program proving is to obtain suitable loop invariants. The invariant of a loop is a weakened form of its postcondition (the loop's goal, als...
128
click to vote
CC
2008
Springer
15 years 3 months ago
2008
Springer
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
124
click to vote
CJTCS
1999
15 years 2 months ago
1999
We show that thepermanent cannot be computed by uniform constantdepth threshold circuits of size Tn, for any function T such that for all k, Tk n = o2n. More generally, we show th...
136
click to vote
ICCS
2009
Springer
15 years 29 days ago
2009
Springer
This article presents a local control approach to linear vehicle platooning. Linear platoon systems are sets of vehicles that use local or global perception capabilities to form a ...