1716 search results - page 124 / 344 » Proving Conditional Termination |
JSC
2006
13 years 8 months ago
2006
In this paper, we analyze the complexity of a zero test for expressions built from formal power series solutions of first order differential equations with non degenerate initial ...
CORR
2004
Springer
13 years 8 months ago
2004
Springer
A variable-length code is a fix-free code if no codeword is a prefix or a suffix of any other codeword. In a fix-free code any finite sequence of codewords can be decoded in both d...
AMC
2000
13 years 8 months ago
2000
The Lyapunov function method is the focus of this paper in proving marginal stability, asymptotical or globally asymptotical stability of discrete dynamic systems. We show that th...
JSYML
2000
13 years 8 months ago
2000
We derive a Mal'cev condition for congruence meet-semidistributivity and then use it to prove two theorems. Theorem A: if a variety in a finite language is congruence meet-sem...
ECCC
2010
13 years 7 months ago
2010
We initiate the study of the proof complexity of propositional encoding of (weak cases of) concrete independence results. In particular we study the proof complexity of Paris-Harr...