Upper Bounds for the Connective Constant of Self-Avoiding Walks.
Sven Erick AlmPublished in: Comb. Probab. Comput. (1993)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- tight bounds
- branch and bound algorithm
- worst case
- lower and upper bounds
- constant factor
- sample complexity
- sample size
- branch and bound
- tight upper and lower bounds
- concept classes
- computational complexity
- supervised learning
- vc dimension
- information systems
- social networks
- artificial intelligence
- information retrieval
- machine learning
- upper bounding
- database