Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle

Computer Science

• Efficient Algorithm 100%
• Subgraphs 100%
• Sampling Algorithm 100%
• Uniform Random 100%

Keyphrases

• Oracle 100%
• Approximate Counting 75%
• Hypergraph 50%
• Fine-grained Complexity 25%
• Number of Edges 25%
• Parameterized Complexity 25%
• Sampling Algorithm 25%
• Induced Subgraph 25%
• Decision Algorithm 25%
• Vertex Coloring 25%

Mathematics

• Edge 100%
• Approximates 100%
• Fine-Grained Complexity 33%
• Running Time 33%
• Clique 33%
• Induced Subgraph 33%