46 search results - page 3 / 10 » A constructive version of Birkhoff's theorem |
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We present a new technique for constructing and analyzing couplings to bound the convergence rate of finite Markov chains. Our main theorem is a generalization of the path couplin...
FORMATS
2003
Springer
14 years 23 days ago
2003
Springer
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
CONCUR
1989
Springer
13 years 11 months ago
1989
Springer
In summary, RDL is an intuitionistic temporal logic for the specification of requirements and design of time-dependent systems. Coverage of RDL includes a backward chaining theore...
CRYPTO
2000
Springer
13 years 12 months ago
2000
Springer
In this paper we investigate the relationship between the nonlinearity and the order of resiliency of a Boolean function. We first prove a sharper version of McEliece theorem for ...
CIE
2007
Springer
13 years 11 months ago
2007
Springer
We study computer virology from an abstract point of view. Viruses and worms are self-replicating programs, whose constructions are essentially based on Kleene's second recurs...