1274 search results - page 139 / 255 » New Proofs for |
130
click to vote
CADE
1998
Springer
15 years 5 months ago
1998
Springer
Abstract. The theorem prover Isabelle is used to formalise and reproduce some of the styles of reasoning used by Newton in his Principia. The Principia's reasoning is resolute...
SACRYPT
1998
Springer
15 years 5 months ago
1998
Springer
In this paper, we present a simple method for generating random-based signatures when random number generators are either unavailable or of suspected quality (malicious or accident...
143
click to vote
COCO
1997
Springer
15 years 5 months ago
1997
Springer
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...
104
click to vote
ICFP
1996
ACM
15 years 5 months ago
1996
ACM
Concurrent ML (CML) is an extension of Standard ML of New Jersey with concurrent features similar to those of process algebra. In this paper, we build upon John Reppy's reduc...
COCO
1994
Springer
15 years 5 months ago
1994
Springer
Recent results by Toda, Vinay, Damm, and Valiant have shown that the complexity of the determinant is characterized by the complexity of counting the number of accepting computati...