Pages that link to "Item:Q3580947"
From MaRDI portal
The following pages link to Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Q3580947):
Displaying 6 items.
- Visibly pushdown languages (Q3580970) (← links)
- Lower bounds for local search by quantum arguments (Q3580990) (← links)
- Multilinear formulas and skepticism of quantum computing (Q3580996) (← links)
- Completeness in two-party secure computation (Q3580999) (← links)
- Quantum and classical query complexities of local search are polynomially related (Q5901075) (← links)
- Multi-linear formulas for permanent and determinant are of super-polynomial size (Q5901079) (← links)
