1998 search results - page 20 / 400 » Complexity of the Cover Polynomial |
COCOON
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
COCOA
2011
Springer
12 years 9 months ago
2011
Springer
The work in this paper is to initiate a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by certain economi...
ISSAC
2005
Springer
14 years 3 months ago
2005
Springer
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
STACS
2009
Springer
14 years 4 months ago
2009
Springer
Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box finite ring by an add...
CCA
2009
Springer
14 years 4 months ago
2009
Springer
d Abstract) Robert Rettinger1 Department of Mathematics and Computer Science University of Hagen, Germany Abstract. We show that under reasonable assumptions there exist Riemann ma...