Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs.
Stephen A. CookJeff EdmondsVenkatesh MedabalimiToniann PitassiPublished in: ICALP (2016)
Keyphrases
- lower bound
- max sat
- upper bound
- objective function
- branch and bound algorithm
- branch and bound
- optimal solution
- worst case
- domain specific
- semantic annotation
- high level
- semantic knowledge
- upper and lower bounds
- lower and upper bounds
- domain independent
- semantic web
- np hard
- natural language
- machine learning
- semantic information
- semantic similarity
- finite state
- vc dimension