Sciweavers

3624 search results - page 410 / 725
» Abstract Algebraic Logic
Sort
View
CC
2006
Springer
147views System Software» more  CC 2006»
15 years 6 months ago
Complexity of Ring Morphism Problems
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
Neeraj Kayal, Nitin Saxena
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
CORR
2006
Springer
116views Education» more  CORR 2006»
15 years 6 months ago
Rewriting modulo in Deduction modulo
Abstract. We study the termination of rewriting modulo a set of equations in the Calculus of Algebraic Constructions, an extension of the Calculus of Constructions with functions a...
Frédéric Blanqui
IJRR
2006
145views more  IJRR 2006»
15 years 6 months ago
Coordinate-free Coverage in Sensor Networks with Controlled Boundaries via Homology
ABSTRACT. We introduce tools from computational homology to verify coverage in an idealized sensor network. Our methods are unique in that, while they are coordinate-free and assum...
V. de Silva, R. Ghrist
ENTCS
2007
110views more  ENTCS 2007»
15 years 6 months ago
Algorithmic Techniques for Maintaining Shortest Routes in Dynamic Networks
In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on this problem spans over more than three decades, in the last couple of years many ...
Camil Demetrescu, Giuseppe F. Italiano