787 search results - page 78 / 158 » Polynomial Constants are Decidable |
IJAC
2007
13 years 9 months ago
2007
Let K x, y be the free associative algebra of rank 2 over an algebraically closed constructive field of any characteristic. We present an algorithm which decides whether or not tw...
NA
2010
13 years 7 months ago
2010
It is well known that it is an ill-posed problem to decide whether a function has a multiple root. Even for a univariate polynomial an arbitrary small perturbation of a polynomial ...
WINE
2010
Springer
13 years 7 months ago
2010
Springer
We consider collusion in path procurement auctions, where payments are determined using the VCG mechanism. We show that collusion can increase the utility of the agents, and in som...
CORR
2011
Springer
13 years 4 months ago
2011
Springer
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particu...
STACS
2012
Springer
12 years 4 months ago
2012
Springer
Queueing networks are gaining attraction for the performance analysis of parallel computer systems. A Jackson network is a set of interconnected servers, where the completion of a...