Loading jsMath...
Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > LIE ALGEBRA:
Reports tagged with Lie algebra:
TR18-164 | 18th September 2018
Nikhil Gupta, Chandan Saha

On the symmetries of design polynomials

Revisions: 1

In a Nisan-Wigderson design polynomial (in short, a design polynomial), the gcd of every pair of monomials has a low degree. A useful example of such a polynomial is the following:

\text{NW}_{d,k}(\mathbf{x}) = \sum_{h \in \mathbb{F}_d[z], ~\deg(h) \leq k}{~~~~\prod_{i = 0}^{d-1}{x_{i, h(i)}}},

where d is a prime, \mathbb{F}_d is the ... more >>>


TR20-091 | 14th June 2020
Janaky Murthy, vineet nair, Chandan Saha

Randomized polynomial-time equivalence between determinant and trace-IMM equivalence tests

Equivalence testing for a polynomial family \{g_m\}_{m \in \mathbb{N}} over a field F is the following problem: Given black-box access to an n-variate polynomial f(\mathbb{x}), where n is the number of variables in g_m for some m \in \mathbb{N}, check if there exists an A \in \text{GL}(n,\text{F}) such that $f(\mathbb{x}) ... more >>>




ISSN 1433-8092 | Imprint