Showing papers in "Journal of Complexity in 1994"

TL;DR: Effective algorithms for computing the Vandermonde determinant and the determination of a Cauchy matrix and in a number of cases they improve the known estimates.

TL;DR: This work provides necessary and sufficient conditions for linear multivariate problems to be tractable or strongly tractable in the worst case, average case, randomized, and probabilistic settings, and considers linearMultivariate problems over reproducing kernel Hilbert spaces, showing that such problems are strong tractable even in the best case setting.

TL;DR: This work presents a systematic method for incorporating prior knowledge (hints) into the learning-from-examples paradigm in a canonical form that is compatible with descent techniques for learning.

TL;DR: The prediction method which is asymptotically superior to other arbitrary ones realized by finite automata is constructed.

TL;DR: A hybrid algorithm of binary search and Newton′s method to compute real roots for a class of real functions is generalized and it is shown that the algorithm computes a root inside (0, R] with error ϵ in O(log log(R/ϵ) time.

TL;DR: It is demonstrated that the "K-oracle complexity" is at least O(1)(n/ln(2Kn))1/3ln(1/?).

TL;DR: It is shown that decision methods for the first-order theory of the reals exist, as was proven by Tarski, and some foundations for a general theory of condition numbers, ill-posed problem instances, and related concepts are developed.

TL;DR: The theory of martingales is applied to obtain tail bounds that yield rigorous almost sure asymptotics for the length of the heuristic tours.

TL;DR: This work shows that independent, identical Monte Carlo algorithms run in parallel, IIP parallelism, and exhibit superlinear speedup, and observes an improved uniprocessor algorithm by the technique of in-code parallelism.

TL;DR: A Schur-type algorithm for solving indefinite Hankel systems of linear equations derived using the language of linear algebra is discussed.

TL;DR: It is found that the complexity depends strongly on how much a priori information the authors have about the breakpoints, whereas only knowing the number of breakpoints is no better than knowing that the problem elements have a bounded derivative in the L2 sense.

TL;DR: Some weakly asymptotically exact estimates for the Gelfand width and other widths are obtained.

TL;DR: This paper derives related upper and lower bounds on the size of nets capable of computing arbitrary dichotomies, using the minimum distance between the two classes as a parameter.

TL;DR: Two hybrid algorithms for finding an ϵ-approximation of a root of a convex real function that is twice differentiable and satisfies a certain growth condition on the intervial are considered.

TL;DR: The paper gives a probabilistic analysis of the remaining effort for an enumerative solution when the corresponding stochastic model is based on a parameter ?

TL;DR: This work presents an information-based complexity problem for which the computational complexity can be any given increasing function of the information complexity, and the information simplicity can beAny non-decreasing function of ??1, where ? is the error parameter.

TL;DR: The computational cost of automatic quadrature programs is analyzed under the hypothesis of exactness (or asymptotic consistence) of local error estimates, and two new algorithms are introduced, called double-adaptive quadratures and triple- Adaptive Quadrature, which achieve outstanding performances on several classes of integrands.

TL;DR: A new a posteriori error bound is derived for Simpson?s quadrature and it is shown that, from a probabilistic point of view, it is significantly better than a bound that is commonly used in practice.

TL;DR: A minimal set of conditions sufficient to assure the existence of a solution to a system of nonnegative linear diophantine equations is presented and a number of special cases of well known NP-complete problems which are subsequently decided in polynomial time are indicated.

TL;DR: An almost optimal lower bound on the one-way communication complexity (i.e.. the minimum number of real-valued messages that have to be exchanged) is established by way of algebraic field extension theory.