Pages that link to "Item:Q3299223"
From MaRDI portal
The following pages link to The polynomial method in circuit complexity applied to algorithm design (invited talk) (Q3299223):
Displaying 10 items.
- Fast exact algorithms using Hadamard product of polynomials (Q832524) (← links)
- Cryptanalytic applications of the polynomial method for solving multivariate equation systems over \(\mathrm{GF}(2)\) (Q2056692) (← links)
- A new coding-based algorithm for finding closest pair of vectors (Q2420648) (← links)
- Faster All-Pairs Shortest Paths via Circuit Complexity (Q4554074) (← links)
- On the Probabilistic Degrees of Symmetric Boolean Functions (Q4959660) (← links)
- From Circuit Complexity to Faster All-Pairs Shortest Paths (Q5009891) (← links)
- Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices (Q5042455) (← links)
- (Q5090396) (← links)
- (Q5874553) (← links)
- A robust version of Hegedűs's lemma, with applications (Q6566590) (← links)