List questions from computational-complexity

Published on 10 Apr 2026 - 19:42

43

Views

How can we efficiently optimise $\sum_{i=1}^N \|a_i -x\|_\infty ^2$ for $N$ very large?

Published on 19 Sep 2020 - 15:45

424

Views

On the Computational Complexity of Reciprocal

Published on 02 Apr 2026 - 23:55

451

Views

Help in understanding properties of big O notation with norms of vectors

Published on 10 Apr 2026 - 17:11

91

Views

Communication complexity of cardinality of set difference

Published on 08 Apr 2026 - 11:10

122

Views

Graph Isomorphism: An algorithm proposal

Published on 28 Mar 2026 - 1:04

33

Views

VC-Dimension Combination of Restructions

Published on 08 Apr 2026 - 0:43

633

Views

Careful proof of $2^{\sqrt{\log(n)}} = O(n^{\log(n)})$

Published on 29 Sep 2020 - 4:32

930

Views

How do I prove Big Theta Notation for a program?

Published on 08 Apr 2026 - 23:11

71

Views

Let $P$ be prime and $Q\subset P$. How feasible is the computation of a Gröbner basis of a min prime over $Q$ compared to the computation for $P$?

Published on 25 Mar 2026 - 22:26

98

Views

Complexity analysis of computing $2^n$ by bit operation

Published on 05 Oct 2020 - 17:18

324

Views

Is finding the minimum feedback arc set problem on eulerian tournaments in P or NP-hard?

Published on 06 Oct 2020 - 7:18

74

Views

Proof such recursive set existence.

Published on 01 Apr 2026 - 4:58

27

Views

Complexity of composing a multivariate polynomial with a vector univariate polynomial.

Published on 29 Mar 2026 - 3:44

142

Views

Can I check $a^b=c$ in polynomial time?

Published on 10 Apr 2026 - 23:24

List Question

Polynomial time for a quadratic equation and linear inequalities?

How can we efficiently optimise $\sum_{i=1}^N \|a_i -x\|_\infty ^2$ for $N$ very large?

On the Computational Complexity of Reciprocal

Help in understanding properties of big O notation with norms of vectors

Communication complexity of cardinality of set difference

Graph Isomorphism: An algorithm proposal

VC-Dimension Combination of Restructions

Careful proof of $2^{\sqrt{\log(n)}} = O(n^{\log(n)})$

How do I prove Big Theta Notation for a program?

Let $P$ be prime and $Q\subset P$. How feasible is the computation of a Gröbner basis of a min prime over $Q$ compared to the computation for $P$?

Complexity analysis of computing $2^n$ by bit operation

Is finding the minimum feedback arc set problem on eulerian tournaments in P or NP-hard?

Proof such recursive set existence.

Complexity of composing a multivariate polynomial with a vector univariate polynomial.

Can I check $a^b=c$ in polynomial time?

Trending Questions

Popular # Hahtags

Popular Questions