923 search results - page 71 / 185 » On a generalization of Stickelberger's Theorem |
177
click to vote
CMA
2010
15 years 3 months ago
2010
Starting with a general definition of the Laplace transform on arbitrary time scales, we specify the Laplace transform on isolated time scales, prove several properties of the Lapl...
226
click to vote
NETWORKS
2011
14 years 9 months ago
2011
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
200
click to vote
CORR
2012
Springer
14 years 1 months ago
2012
Springer
The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement algorithm ...
184
click to vote
POPL
2012
ACM
14 years 1 months ago
2012
ACM
Formal models serve in many roles in the programming language community. In its primary role, a model communicates the idea of a language design; the architecture of a language to...
126
click to vote
ICDCS
2005
IEEE
15 years 11 months ago
2005
IEEE
We prove two theorems saying that no distributed system in which processes coordinate using reliable registers and -resilient services can solve the consensus problem in the prese...