On the Complexity of Computing Error Bounds.

James Demmel Benjamin Diament Gregorio Malajovich

Published in: Found. Comput. Math. (2001)

Keyphrases

error bounds
worst case
theoretical analysis
upper bound
lower bound
real time
information systems
neural network
database
decision trees
case study
np hard
computer vision
databases
greedy algorithm
finite sample
polynomial time approximation