Sciweavers

3333 search results - page 299 / 667
» Abstract Proof Search
Sort
View
CRYPTO
1989
Springer
163views Cryptology» more  CRYPTO 1989»
15 years 10 months ago
Undeniable Signatures
Abstract. In this paper, we provide a new approach to study undeniable signatures by translating secure digital signatures to secure undeniable signatures so that the existing algo...
David Chaum, Hans Van Antwerpen
STOC
1992
ACM
110views Algorithms» more  STOC 1992»
15 years 10 months ago
Linear Decision Trees: Volume Estimates and Topological Bounds
Abstract. We describe two methods for estimating the size and depth of decision trees where a linear test is performed at each node. Both methods are applied to the question of dec...
Anders Björner, László Lov&aacu...
ANTS
2010
Springer
252views Algorithms» more  ANTS 2010»
15 years 10 months ago
On a Problem of Hajdu and Tengely
Abstract. We answer a question asked by Hajdu and Tengely: The only arithmetic progression in coprime integers of the form (a2 , b2 , c2 , d5 ) is (1, 1, 1, 1). For the proof, we ï...
Samir Siksek, Michael Stoll
DIAGRAMS
2010
Springer
15 years 10 months ago
Toward a Physics of Equations
Papers on diagrammatic reasoning often begin by dividing marks on paper into two basic classes: diagrams and sentences. While endorsing the perspective that a reasoning episode can...
David Landy
ITP
2010
155views Mathematics» more  ITP 2010»
15 years 10 months ago
A Trustworthy Monadic Formalization of the ARMv7 Instruction Set Architecture
Abstract. This paper presents a new HOL4 formalization of the current ARM instruction set architecture, ARMv7. This is a modern RISC architecture with many advanced features. The f...
Anthony C. J. Fox, Magnus O. Myreen