✦ LIBER ✦

The computational complexity of a set of quadratic functions

✍ Scribed by Joseph Ja'Ja'

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 582 KB
Volume: 24
Category: Article
ISSN: 0022-0000
DOI: 10.1016/0022-0000(82)90049-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computational Complexity of Algebraic Fu

Computational Complexity of Algebraic Functions

✍ Nicholas Pippenger 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 919 KB

Correction to “Computational complexity

Correction to “Computational complexity of algebraic functions”

✍ Nicholas Pippenger 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 269 KB

The Computational Complexity of Choice S

The Computational Complexity of Choice Sets

✍ Felix Brandt; Felix Fischer; Paul Harrenstein 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 136 KB

## Abstract Social choice rules are often evaluated and compared by inquiring whether they satisfy certain desirable criteria such as the __Condorcet criterion__, which states that an alternative should always be chosen when more than half of the voters prefer it over any other alternative. Many of

Complexity of Computing the Local Dimens

Complexity of Computing the Local Dimension of a Semialgebraic Set

✍ Nicolai Vorobjov 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 521 KB

The paper describes several algorithms related to a problem of computing the local dimension of a semialgebraic set. Let a semialgebraic set V be defined by a system of k inequalities of the form f ≥ 0 with f ∈ R[X 1 , . . . , Xn], deg(f ) < d, and x ∈ V . An algorithm is constructed for computing t

The Computational Complexity of Antimatr

The Computational Complexity of Antimatroid Properties

✍ Jamas Enright 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 164 KB

Oracle complexity for antimatroids is defined. Several antimatroid oracles are compared and their relative strengths are examined. Characterizations of several classes of antimatroids are given, and the complexity of recognising membership of these classes is examined.

The Computational Complexity of Densest

The Computational Complexity of Densest Region Detection

✍ Shai Ben-David; Nadav Eiron; Hans Ulrich Simon 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 296 KB

We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from unlabeled samples of this distribution. We introduce a formal learning model for this task that uses a hypothesis class as it ''anti-overfitting'' mechanism. The learning task in our mo