Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems.
Abhishek MethukuDömötör PálvölgyiPublished in: Comb. Probab. Comput. (2017)
Keyphrases
- special case
- computationally hard
- databases
- multi agent
- upper bound
- optimization problems
- computationally challenging
- specific problems
- related problems
- solving problems
- problems involving
- closely related
- lower bound
- multiscale
- information systems
- benchmark problems
- expert systems
- reinforcement learning
- convex functions
- similarity measure