Average Polynominal Time Is Hard for Exponential Time Under sn-Reductions.

Published in: FSTTCS (1995)

Keyphrases

efficient computation
random constraint satisfaction problems
standard deviation
database
information technology
weighted average
bayesian networks
information retrieval
data mining
multi agent systems
three dimensional
user interface
case study
confidence intervals
relative error
linear complexity
neural network