Topic
Average-case complexity
About: Average-case complexity is a research topic. Over the lifetime, 1749 publications have been published within this topic receiving 44972 citations.
Papers published on a yearly basis
Papers
More filters
01 Jan 2004
TL;DR: In this paper, the authors propose a solution to solve the problem of the problem: this paper.v.v.s.q.vq.qqq q.
Abstract: v
09 Sep 1996
TL;DR: The main result of the paper is the detailed complexity analysis of the weak unification problem by providing a formula for determining the number of weak unifiers.
Abstract: In this paper we consider the problem of weak unification of bounded simple set terms. Simple set terms are of the form {e1, ..., en}, where ei is a constant or a variable and are much used in deductive database systems such as \(\mathcal{L}\mathcal{D}\mathcal{L}\)and Coral. We consider a restricted form of unification, called “weak unification”, which is mainly used in the field of deductive databases where the database may contain both constants and variables and the program is “safe”. The main result of the paper is the detailed complexity analysis of the weak unification problem by providing a formula for determining the number of weak unifiers.
17 Sep 1986
TL;DR: A new parallel direct algorithm for solving general linear systems of equations that requires less computations than the classical Jordan algorithm and two related algorithms for linear recurrence problems of order 1 and tridiagonal systems are derived.
Abstract: A new parallel direct algorithm for solving general linear systems of equations ist proposed in this paper For sparse systems our algorithm requires less computations than the classical Jordan algorithm Particularly we have also derived two related algorithms for linear recurrence problems of order 1 and tridiagonal systems Each of the two algorithms has the same computational complexity as that of the corresponding recursive doubling algorithm or Even/Odd elimination algorithm, but requires half of the processors required by the corresponding algorithm
Proceedings Article•
01 Jan 2004
01 Jan 1991
TL;DR: The relationship of PP to other complexity classes, in particular NP and the polynomial hierarchy, is explored, and closure under some standard operations such as intersection and complementation is discussed.
Abstract: The purpose of this work is to present an overview of the class of problems solvable in probabilistic polynomial time with double sided error (PP ). We explore the relationship of PP to other complexity classes, in particular NP and the polynomial hierarchy, and discuss closure under some standard operations such as intersection and complementation. New proofs are given of some results from the literature using techniques developed by the author.