Sciweavers

3552 search results - page 370 / 711
» Proof theory in the abstract
Sort
View
COMBINATORICS
2006
221views more  COMBINATORICS 2006»
15 years 6 months ago
Kernels of Directed Graph Laplacians
Abstract. Let G denote a directed graph with adjacency matrix Q and indegree matrix D. We consider the Kirchhoff matrix L = D - Q, sometimes referred to as the directed Laplacian. ...
John S. Caughman IV, J. J. P. Veerman
DAM
2006
97views more  DAM 2006»
15 years 6 months ago
Entity authentication schemes using braid word reduction
Abstract. Artin's braid groups currently provide a promising background for cryptographical applications, since the first cryptosystems using braids were introduced in [2, 3, ...
Hervé Sibert, Patrick Dehornoy, Marc Giraul...
JAR
2008
77views more  JAR 2008»
15 years 6 months ago
Translating Higher-Order Clauses to First-Order Clauses
Interactive provers typically use higher-order logic, while automatic provers typically use first-order logic. In order to integrate interactive provers with automatic ones, it is ...
Jia Meng, Lawrence C. Paulson
CORR
2007
Springer
75views Education» more  CORR 2007»
15 years 6 months ago
On Undetected Error Probability of Binary Matrix Ensembles
Abstract— In this paper, analysis on undetected error probability of ensembles of m × n binary matricies is presented. Two ensembles are considered: One is an ensemble of dense ...
Tadashi Wadayama
JLP
2008
108views more  JLP 2008»
15 years 6 months ago
Composition mechanisms for retrenchment
Abstract. Retrenchment is a flexible model evolution formalism that arose as a reaction to the limitations imposed by refinement, and for which the proof obligations feature additi...
Richard Banach, Czeslaw Jeske, Michael Poppleton