15 search results - page 3 / 3 » Iteration Algebras Are Not Finitely Axiomatizable. Extended ... |
ICISC
2000
13 years 6 months ago
2000
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
CONCUR
2006
Springer
13 years 7 months ago
2006
Springer
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
ALT
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. Inductive inference can be considered as one of the fundamental paradigms of algorithmic learning theory. We survey results recently obtained and show their impact to pot...
LATA
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
ICS
2007
Tsinghua U.
13 years 11 months ago
2007
Tsinghua U.
Positive results from new object-oriented tools for scientific programming are reported. Using template classes, abstractions of matrix representations are available that subsume...