Lower Bounds for Tolerant Junta and Unateness Testing via Rejection Sampling of Graphs.
Amit LeviErik WaingartenPublished in: ITCS (2019)
Keyphrases
- lower bound
- upper bound
- objective function
- branch and bound algorithm
- optimal solution
- graph representation
- directed graph
- branch and bound
- graph matching
- graph theory
- quadratic assignment problem
- upper and lower bounds
- graph theoretic
- graph partitioning
- graph databases
- graph mining
- graph structure
- parameter space
- test cases
- software testing
- worst case
- np hard
- sampling methods
- graph kernels
- data structure
- lower bounding