✦ LIBER ✦

On the Complexity of Computing Error Bounds

✍ Scribed by J. Demmel; B. Diament; G. Malajovich

Publisher: Springer-Verlag
Year: 2001
Tongue: English
Weight: 165 KB
Volume: 1
Category: Article
ISSN: 1615-3375
DOI: 10.1007/s10208001004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of computing determina

On the complexity of computing determinants

✍ Erich Kaltofen; Gilles Villard 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 412 KB

On certain computable tests and componen

On certain computable tests and componentwise error bounds

✍ Z. Shen; M. A. Wolfe 📂 Article 📅 1993 🏛 Springer Vienna 🌐 English ⚖ 548 KB

Lower Bounds on the Multiparty Communica

Lower Bounds on the Multiparty Communication Complexity

✍ Pavol Ďuriš; José D.P. Rolim 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 236 KB

New upper bounds on the linear complexit

New upper bounds on the linear complexity

✍ P. Caballero-Gil 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 478 KB

Improved Bounds on the Sample Complexity

Improved Bounds on the Sample Complexity of Learning

✍ Yi Li; Philip M. Long; Aravind Srinivasan 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 137 KB

We present a new general upper bound on the number of examples required to estimate all of the expectations of a set of random variables uniformly well. The quality of the estimates is measured using a variant of the relative error proposed by Haussler and Pollard. We also show that our bound is wit

On the computational complexity of query

On the computational complexity of querying bounds on differences constraints

✍ Vittorio Brusoni; Luca Console; Paolo Terenziani 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 891 KB

Given a consistent knowledge base formed by a set of constraints, efficient query answering (e.g., checking whether a set of constraints is consistent with the knowledge base or necessarily true in it) is practically very important. In the paper we consider bounds on differences (which are an import