1399 search results - page 40 / 280 » Multi-party Finite Computations |
PROCEDIA
2010
13 years 4 months ago
2010
We argue that producing maintainable high-performance implementations of finite element methods for multiple targets requires that they are written using a high-level domain-speci...
BIRTHDAY
2010
Springer
13 years 10 months ago
2010
Springer
Let M = (A, <, P) where (A, <) is a linear ordering and P denotes a finite sequence of monadic predicates on A. We show that if A contains an interval of order type or -, an...
DCC
2010
IEEE
13 years 10 months ago
2010
IEEE
We derive lower and upper bounds for the size of a hyperoval of a finite polar space of rank r {2, 3}. We give a computer-free proof for the uniqueness, up to isomorphism, of the...
APAL
2000
13 years 9 months ago
2000
It is shown how to restrict recursion on notation in all finite types so as to characterize the polynomial time computable functions. The restrictions are obtained by using a rami...
DLT
2009
13 years 7 months ago
2009
Abstract. We study expansions in non-integer negative base - introduced by Ito and Sadahiro [7]. Using countable automata associated with (-)-expansions, we characterize the case w...