Pages that link to "Item:Q1894453"
From MaRDI portal
The following pages link to The power of the middle bit of a \(\#\)P function (Q1894453):
Displaying 14 items.
- Lower bounds against weakly-uniform threshold circuits (Q486977) (← links)
- Average-case intractability vs. worst-case intractability (Q598182) (← links)
- On learning embedded midbit functions (Q817826) (← links)
- On the complexity of computing the logarithm and square root functions on a complex domain (Q870336) (← links)
- Relating polynomial time to constant depth (Q1274992) (← links)
- On closure properties of GapP (Q1337146) (← links)
- The correlation between parity and quadratic polynomials mod \(3\) (Q1881261) (← links)
- Implicit recursion-theoretic characterizations of counting classes (Q2085583) (← links)
- A structured view on weighted counting with relations to counting, quantum computation and applications (Q2216125) (← links)
- Uniform proofs of ACC representations (Q2402964) (← links)
- On set intersection representations of graphs (Q3633007) (← links)
- Relationships among $PL$, $\#L$, and the determinant (Q4889814) (← links)
- On the Complexity of the Pancake Problem (Q4921438) (← links)
- Counting problems for parikh images (Q5111226) (← links)
