Pages that link to "Item:Q3718150"

The following pages link to On Approximation Algorithms for # P (Q3718150):

Displaying 50 items.

• The complexity of estimating min-entropy (Q260395) (← links)
• The relative exponential time complexity of approximate counting satisfying assignments (Q309794) (← links)
• Randomness buys depth for approximate counting (Q483707) (← links)
• Approximation algorithms for \(k\)-hurdle problems (Q627530) (← links)
• A tight analysis and near-optimal instances of the algorithm of Anderson and Woll (Q706634) (← links)
• On the complexity of counting in the polynomial hierarchy (Q808260) (← links)
• A note on enumerative counting (Q809598) (← links)
• On triangle estimation using tripartite independent set queries (Q825973) (← links)
• \(\text{S}_{2}^{\text{P}} \subseteq \text{ZPP}^{\text{NP}}\) (Q859979) (← links)
• On the complexity of ranking (Q920620) (← links)
• The parameterized complexity of probability amplification (Q975525) (← links)
• Relativized alternation and space-bounded computation (Q1111024) (← links)
• Graph isomorphism is in the low hierarchy (Q1116696) (← links)
• Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P (Q1193633) (← links)
• Probabilistic complexity classes and lowness (Q1263979) (← links)
• On relationships between approximate and probabilistic complexity classes (Q1326985) (← links)
• Locating \(P\)/poly optimally in the extended low hierarchy (Q1341715) (← links)
• On randomized versus deterministic computation (Q1365675) (← links)
• A \(q\)-analog of approximation inclusion-exclusion (Q1383437) (← links)
• Optimal proof systems imply complete sets for promise classes (Q1398371) (← links)
• Semantics and complexity of abduction from default theories (Q1402749) (← links)
• Relativized separation of EQP from \(\text{P}^{\text{NP}}\) (Q1607126) (← links)
• Approximate counting in SMT and value estimation for probabilistic programs (Q1683928) (← links)
• Enumerative counting is hard (Q1822963) (← links)
• Parameterized random complexity (Q1946497) (← links)
• Model counting with error-correcting codes (Q2009186) (← links)
• Amplification with one \textsf{NP} oracle query (Q2125078) (← links)
• Completeness, approximability and exponential time results for counting problems with easy decision version (Q2143122) (← links)
• On the complexity of finding shortest variable disjunction branch-and-bound proofs (Q2164707) (← links)
• On the de-randomization of space-bounded approximate counting problems (Q2348703) (← links)
• Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
• Dimension, entropy rates, and compression (Q2495412) (← links)
• On the hardness of approximate reasoning (Q2674206) (← links)
• The Approximability of the Binary Paintshop Problem (Q2851858) (← links)
• (Q2934606) (← links)
• The Relative Exponential Time Complexity of Approximate Counting Satisfying Assignments (Q2946032) (← links)
• The computational complexity of linear optics (Q3191572) (← links)
• On Parameterized Approximability (Q3499729) (← links)
• Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances (Q4457892) (← links)
• Quantum-walk speedup of backtracking algorithms (Q4612479) (← links)
• A chasm between identity and equivalence testing with conditional queries (Q4612483) (← links)
• On randomized versus deterministic computation (Q4630263) (← links)
• Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation (Q4809670) (← links)
• Edge estimation with independent set oracles (Q4993304) (← links)
• On Pseudodeterministic Approximation Algorithms. (Q5005164) (← links)
• (Q5092454) (← links)
• On the parameterized complexity of approximate counting (Q5198932) (← links)
• ANALYSIS OF QUANTUM FUNCTIONS (Q5696940) (← links)
• One-Way Functions and (Im)perfect Obfuscation (Q5885583) (← links)
• Computational arithmetic geometry. I: Sentences nearly in the polynomial hierarchy (Q5943088) (← links)