Pages that link to "Item:Q3988836"

The following pages link to #P-COMPLETENESS VIA MANY-ONE REDUCTIONS (Q3988836):

Displaying 22 items.

• Pseudorandom generators, typically-correct derandomization, and circuit lower bounds (Q430845) (← links)
• The consequences of eliminating NP solutions (Q458458) (← links)
• Lower bounds against weakly-uniform threshold circuits (Q486977) (← links)
• Arithmetization: A new method in structural complexity theory (Q685721) (← links)
• Nondeterministic functions and the existence of optimal proof systems (Q837177) (← links)
• Universal relations and {\#}P-completeness (Q954984) (← links)
• On the autoreducibility of functions (Q970103) (← links)
• A note on \(\#\mathcal P\)-completeness of NP-witnessing relations (Q976088) (← links)
• The complexity of power-index comparison (Q1001906) (← links)
• Polynomial-time 1-Turing reductions from \(\#\)PH to \(\#\)P (Q1193633) (← links)
• On the hardness of counting problems of complete mappings. (Q1426113) (← links)
• The complexity of problems for quantified constraints (Q1959381) (← links)
• Counting Hamiltonian cycles on quartic 4-vertex-connected planar graphs (Q2308511) (← links)
• Subtractive reductions and complete problems for counting complexity classes (Q2566034) (← links)
• Barnette's conjecture through the lens of the \(Mod_k P\) complexity classes (Q2695474) (← links)
• Permanent Does Not Have Succinct Polynomial Size Arithmetic Circuits of Constant Depth (Q3012845) (← links)
• A Dichotomy Theorem for Polynomial Evaluation (Q3182924) (← links)
• Relationships among $PL$, $\#L$, and the determinant (Q4889814) (← links)
• SELF-SPECIFYING MACHINES (Q5249003) (← links)
• Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
• HyperLTL Satisfiability Is Σ₁¹-Complete, HyperCTL* Satisfiability Is Σ₁²-Complete. (Q6168463) (← links)
• Complexity and enumeration in models of genome rearrangement (Q6646439) (← links)