The following pages link to Theory of Computing (Q2816408):
Displaying 50 items.
- (Q2816409) (← links)
- (Q2816410) (← links)
- (Q2816411) (← links)
- (Q2816412) (← links)
- (Q2816413) (← links)
- Quantum Homomorphic Encryption for Polynomial-Sized Circuits (Q2829941) (← links)
- (Q2830864) (← links)
- (Q2830865) (← links)
- (Q2830866) (← links)
- (Q2830868) (← links)
- (Q2830869) (← links)
- (Q2830870) (← links)
- Anti-concentration for polynomials of independent random variables (Q2830871) (← links)
- (Q2830872) (← links)
- A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs (Q2851865) (← links)
- Inverse Conjecture for the Gowers norm is false (Q2913795) (← links)
- (Q2913796) (← links)
- (Q2913798) (← links)
- (Q2913799) (← links)
- (Q2913800) (← links)
- (Q2913801) (← links)
- (Q2913802) (← links)
- (Q2913803) (← links)
- (Q2913804) (← links)
- (Q2913805) (← links)
- (Q2913806) (← links)
- (Q2913807) (← links)
- (Q2913808) (← links)
- (Q2913809) (← links)
- (Q2913810) (← links)
- (Q2913811) (← links)
- (Q2913812) (← links)
- Span-program-based quantum algorithm for evaluating formulas (Q2913813) (← links)
- (Q2913814) (← links)
- (Q2913815) (← links)
- Quantum Private Information Retrieval with Sublinear Communication Complexity (Q2913816) (← links)
- (Q2913817) (← links)
- (Q2913818) (← links)
- (Q2913819) (← links)
- (Q2913820) (← links)
- (Q2913822) (← links)
- (Q2913823) (← links)
- Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors (Q2913824) (← links)
- (Q2941633) (← links)
- New lower bounds for the border rank of matrix multiplication (Q2941634) (← links)
- (Q2941635) (← links)
- (Q2941637) (← links)
- (Q2941638) (← links)
- (Q2941639) (← links)
- Some remarks on multiplicity codes (Q2941640) (← links)