List questions from computational-complexity

Published on 06 Jun 2020 - 18:36

346

Views

An Algorithm For Finding Modular Square Roots

Published on 29 Mar 2026 - 20:02

260

Views

What is the complexity of the cramer method?

Published on 07 Jun 2020 - 18:12

4.4k

Views

Feedback Vertex Set NP-complete proof

Published on 26 Mar 2026 - 3:10

119

Views

Solving $aX^3 + bY^3 + cZ^3 - dXYZ = 0$ over $\mathbb{F}_q$

Published on 27 Mar 2026 - 1:46

549

Views

Find the affine transformation to minimize the distance between two sets of points

Published on 26 Mar 2026 - 9:17

40

Views

For $x \in \mathbb{Q}^n$ and $\langle x \rangle$ its encoding length, show: $||x||_1 \leq 2^{\langle x \rangle -n} - 1$.

Published on 30 Mar 2026 - 12:58

22

Views

Find the maximal Radius of a graph for any removal of a set of up to k vertices

Published on 26 Mar 2026 - 3:13

2.6k

Views

How do we know that the P versus NP problem is an NP problem itself?

Published on 26 Mar 2026 - 13:42

31

Views

Measure of the relative complexity of equations

Published on 18 Jun 2020 - 15:45

65

Views

Are P, NP, PSPACE, and NPSPACE complexity classes?

Published on 18 Jun 2020 - 15:52

81

Views

Is Shortest-Spanning-$(u,v)$-Walk NP-complete?

Published on 19 Jun 2020 - 20:02

359

Views

Solving QUBO: does the knowledge of the optimal solution help with finding an optimal argument?

Published on 25 Mar 2026 - 17:44

219

Views

Can you win the urn depletion game?

Published on 26 Mar 2026 - 4:52

53

Views

Find exactly k columns in binary matrix such that the sum of those columns is the 1-vector

Published on 20 Jun 2020 - 16:44

List Question

How to solve a fraction of imaginary numbers?

An Algorithm For Finding Modular Square Roots

What is the complexity of the cramer method?

Feedback Vertex Set NP-complete proof

Solving $aX^3 + bY^3 + cZ^3 - dXYZ = 0$ over $\mathbb{F}_q$

Find the affine transformation to minimize the distance between two sets of points

For $x \in \mathbb{Q}^n$ and $\langle x \rangle$ its encoding length, show: $||x||_1 \leq 2^{\langle x \rangle -n} - 1$.

Find the maximal Radius of a graph for any removal of a set of up to k vertices

How do we know that the P versus NP problem is an NP problem itself?

Measure of the relative complexity of equations

Are P, NP, PSPACE, and NPSPACE complexity classes?

Is Shortest-Spanning-$(u,v)$-Walk NP-complete?

Solving QUBO: does the knowledge of the optimal solution help with finding an optimal argument?

Can you win the urn depletion game?

Find exactly k columns in binary matrix such that the sum of those columns is the 1-vector

Trending Questions

Popular # Hahtags

Popular Questions