… manipulating black-box polynomials should be available. In this paper we present an algorithm
for constructing a black-box representation for the resultant of two black-box polynomials. …

… Before discussing our results, let us mention a linear algebra setting in which … We now
present the algorithm that takes a black box for a multivariate polynomial and produces a program …

… about black-box groups can be obtained in polynomial time. … not assume an" oracle"(black
box) for discrete logarithms, and … For our results about general black-box groups (as opposed …

… by choosing arbitrary values for the public variables, and his goal is to solve the resultant
system of polynomial equations in terms of their common secret variables. In this paper we …

… of a polynomial the corresponding black box. With sparse … of a polynomial from a given
black box in polynomial time. … With the resultant we have a powerful (theoretical) tool to …

… polynomial decomposition. More accurately, we show that for any reasonable circuit class
there is a deterministic polynomial time (black-box) algorithm for polynomial … of our results we …

… are piecewise polynomials. The connections of the pieces of polynomials have continuous
… We shall here focus on one that allows some important analytical results. We measure the fit …

… polynomials P of degree less than or equal to M. This quantity measures the quality of the
local fit off by polynomials … We now state a sample of results about the properties of kernel …

… black-box simulators. Using these new non-black-box techniques we obtain several results
… simulator that runs in strict polynomial time (rather than expected polynomial running time) or …

… In our view, two important results are that we can place relativizing reductions between
non-… For such an Af let S be a probabilistic polynomial-time reduction making black-box use of …