New answers tagged polynomials
2
votes
Applications of association schemes to complexity theory and other TCS
Coherent configurations are a close generalization of association schemes they have been used in Graph Isomorphism and Matrix Multiplication. (See e.g. this blog post of Peter Cameron that discusses ...
Top 50 recent answers are included
Related Tags
polynomials × 102cc.complexity-theory × 43
algebra × 17
algebraic-complexity × 13
ds.algorithms × 11
reference-request × 9
circuit-complexity × 9
boolean-functions × 8
finite-fields × 8
time-complexity × 7
co.combinatorics × 6
polynomial-time × 6
coding-theory × 5
factoring × 5
linear-algebra × 4
np-hardness × 3
optimization × 3
cr.crypto-security × 3
lower-bounds × 3
randomized-algorithms × 3
np-complete × 3
derandomization × 3
nt.number-theory × 3
permutations × 3
arithmetic-circuits × 3