Login / Signup
Lower Bounds and the Hardness of Counting Properties.
Lane A. Hemaspaandra
Mayur Thakur
Published in:
IFIP TCS (2002)
Keyphrases
</>
lower bound
upper bound
objective function
np hard
worst case
np complete
desirable properties
branch and bound
branch and bound algorithm
real time
neural network
phase transition
sample complexity
lower and upper bounds