697 search results - page 21 / 140 » On the Theory of Average Case Complexity |
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
We study arithmetic operations for triangular families of polynomials, concentrating on multiplication in dimension zero. By a suitable extension of fast univariate Euclidean divi...
ISSAC
2007
Springer
14 years 1 months ago
2007
Springer
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
JAIR
2008
13 years 7 months ago
2008
In this paper, we elucidate the equivalence between inference in game theory and machine learning. Our aim in so doing is to establish an equivalent vocabulary between the two dom...
IADIS
2004
13 years 9 months ago
2004
The evolving nature of complex traffic issues of IP (Internet Protocol)-based Telecollaboration (TC) business system technology requires an intuitive understanding for the partici...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Büchi, regular languages have been classified according ...