Sciweavers

1383 search results - page 75 / 277
» On the Complexity of the Interlace Polynomial
Sort
View
SIAMMAX
2011
180views more  SIAMMAX 2011»
15 years 1 months ago
Computing Characteristic Polynomials from Eigenvalues
Abstract. This paper concerns the computation of the coefficients ck of the characteristic polynomial of a real or complex matrix A. We analyze the forward error in the coefficient...
Rizwana Rehman, Ilse C. F. Ipsen
STOC
2006
ACM
108views Algorithms» more  STOC 2006»
16 years 6 months ago
Extractors for a constant number of polynomially small min-entropy independent sources
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
Anup Rao
ISSAC
1997
Springer
142views Mathematics» more  ISSAC 1997»
15 years 10 months ago
The Structure of Sparse Resultant Matrices
Resultants characterize the existence of roots of systems of multivariate nonlinear polynomial equations, while their matrices reduce the computation of all common zeros to a prob...
Ioannis Z. Emiris, Victor Y. Pan
CORR
2008
Springer
159views Education» more  CORR 2008»
15 years 6 months ago
Stochastic Limit-Average Games are in EXPTIME
The value of a finite-state two-player zero-sum stochastic game with limit-average payoff can be approximated to within in time exponential in a polynomial in the size of the gam...
Krishnendu Chatterjee, Rupak Majumdar, Thomas A. H...
ECCC
2002
74views more  ECCC 2002»
15 years 6 months ago
On the proper learning of axis parallel concepts
We study the proper learnability of axis-parallel concept classes in the PAC-learning and exactlearning models. These classes include union of boxes, DNF, decision trees and multi...
Nader H. Bshouty, Lynn Burroughs