1274 search results - page 51 / 255 » New Proofs for |
78
Voted
ISSAC
1994
Springer
15 years 4 months ago
1994
Springer
After four years of experience with the nonassociative algebra program Albert, we highlight its successes and drawbacks. Among its successes are the discovery of several new resul...
108
Voted
DCG
2006
15 years 19 days ago
2006
We show, with an elementary proof, that the number of halving simplices in a set of n points in R4 in general position is O(n4-2/45). This improves the previous bound of O(n4-1/13...
138
Voted
ECCC
2006
15 years 18 days ago
2006
We prove a number of general theorems about ZK, the class of problems possessing (computational) zero knowledge proofs. Our results are unconditional, in contrast to most previous...
104
Voted
JCT
2007
15 years 15 days ago
2007
An edge in a drawing of a graph is called even if it intersects every other edge of the graph an even number of times. Pach and T´oth proved that a graph can always be redrawn so...
100
click to vote
FSE
2006
Springer
15 years 4 months ago
2006
Springer
In this paper, we define and analyze a new blockcipher mode of operation for encryption, CENC, which stands for Cipher-based ENCryption. CENC has the following advantages: (1) bey...