The algebraic-complexity tag has no usage guidance.

**1**

vote

**0**answers

38 views

### Bit complexity versus arithmetic complexity of polynomial multiplication

Given degree $d_1$ and $d_2$ polynomials in $\Bbb Z[x]$ with coefficient sizes of bits $b_1$ and $b_2$ respectively
(1) what is the bit complexity of multiplying the two polynomials?
(2) What is ...

**12**

votes

**0**answers

192 views

### $p$-Adic or arithmetic variants of Khovanskii's “low complexity $\Rightarrow$ tame topology” theory

This question is prompted by a remark I made in a comment to Is every polynomial a factor of a trinomial?, which was that Descartes's observation (cf. his rule of signs, etc.), that the number of real ...

**3**

votes

**1**answer

164 views

### Can we define a height function for a variety over a finite field?

That is, is there a way to measure the complexity of a point over a finite field the same way we do it over number fields?

**4**

votes

**0**answers

174 views

### What is the complexity of intersecting two matrix algebras over a finite field?

The following question arose in a joint project with Arkadius Kalka and Adi Ben-Zvi.
Let $\mathbb{F}$ be a finite field, and $M_n(\mathbb{F})$ be the $n\times n$ matrices over $\mathbb{F}$.
For a ...

**4**

votes

**0**answers

152 views

### How large do algebraic representations need to be for packing circles in squares?

(This question is inspired by Erich's Packing Center.
I'm just asking about circles in squares to keep things simple, since I suspect
any answer would apply just-as-well to the rest of the problems ...

**2**

votes

**0**answers

145 views

### Consequences failure of $\tau$ conjecture

A question Bounds for constructing $n!$ with additions, subtractions, and multiplications starting from $1$ was asked on constructing $ak!$ with ring operations.
$\tau$ conjecture states if $\exists$ ...

**4**

votes

**1**answer

276 views

### The existential theory of the reals

Some definitions of the existential theory of the reals (ETR) allow a real closed field and some definitions allow only rational numbers as coefficients of polynomials. Which one is correct? Will the ...

**3**

votes

**0**answers

147 views

### Gaussian Elimination in terms of Group Action

Gaussian elimination makes determinant of a matrix polynomial-time computable. The reduction of complexity in computing the determinant, which is otherwise sum of exponential terms, is due to presence ...

**10**

votes

**1**answer

293 views

### What is the largest tensor rank on matrix.

A tensor rank of tree dimentional matrix $M[i,j,k], i,j,k\in [1,\ldots,n]$ is a minimal number of vectors $x_i,y_i,z_i$, such that $M=\sum_{i=1}^d x_i\otimes y_i\otimes z_i$.
From dimension argument ...