Fine-Grained Reductions from Approximate Counting to Decision

Keyphrases

• Approximate Counting 100%
• Fine-grained Reductions 100%
• Negative Weight 66%
• Orthogonal Vectors 66%
• Triangle Problem 66%
• Vector Problem 66%
• Fine-grained Complexity 33%
• Counting Problems 33%
• Polynomial Time 33%
• Oracle 33%
• SIMPLE Algorithm 33%
• Time Algorithm 33%
• Orthogonal Pair 33%
• #SAT 33%
• 3SUM 33%
• #Sat 33%
• Most Important Problem 33%
• All-pairs Shortest Paths 33%
• Strong Exponential Time Hypothesis 33%

Computer Science

• Orthogonal Vector 100%
• Negative Weight 100%
• Efficient Algorithm 50%
• Polynomial Time 50%
• Simple Algorithm 50%
• Pair Shortest Path 50%
• Foundational Result 50%

Mathematics

• Approximates 100%
• Triangle 50%
• Counting Problem 25%
• Fine-Grained Complexity 25%
• Polynomial 25%
• Running Time 25%
• Exponential Time 25%
• Polynomial Time 25%
• Exp 25%