1688 search results - page 3 / 338 » The Complexity of Rationalizing Matchings |
SIGECOM
2011
ACM
12 years 8 months ago
2011
ACM
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
IJBC
2006
13 years 5 months ago
2006
We consider several discrete dynamical systems for which some invariants can be found. Our study includes complex M
PARA
2004
Springer
13 years 10 months ago
2004
Springer
Rational Krylov is an extension of the Lanczos or Arnoldi eigenvalue algorithm where several shifts (matrix factorizations) are used in one run. It corresponds to multipoint moment...
STOC
1989
ACM
13 years 9 months ago
1989
ACM
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division nding reciprocals that...