List questions from computational-complexity

Published on 26 Mar 2026 - 7:58

47

Views

NP-Hardness of finding minimal support for $Ax=b$ for $F_2$ implies the same over $F_p$

Published on 05 Feb 2017 - 2:33

37

Views

What is the complexity of given problem?

Published on 05 Feb 2017 - 20:57

300

Views

If $\overline{L}$ is NL-hard, can we infer that $L$ is also NL-hard?

Published on 07 Feb 2017 - 15:17

2.6k

Views

Can a set and its complement have intersection?

Published on 08 Feb 2017 - 1:59

47

Views

Computational complexity of upwind scheme

Published on 10 Feb 2017 - 12:18

47

Views

Notation for: the number of triangles $t$ in graph $G = (V,E)$ dominates its number of edges and vertices

Published on 11 Feb 2017 - 13:08

429

Views

Reference for creative set criterion theorem

Published on 29 Mar 2026 - 19:07

377

Views

Decomposition of a Graph into Linear Forests

Published on 13 Feb 2017 - 17:06

852

Views

How can I prove that n . log n is a time constructible function?

Published on 15 Feb 2017 - 5:28

310

Views

Does (or when does) $O(\log\text{poly}(n)) = O(\text{poly}(\log(n)))$?

Published on 17 Feb 2017 - 0:49

1.3k

Views

Can a problem be undecidable but yet Turing recognizable?

Published on 23 Feb 2026 - 10:14

664

Views

Growth rate of n(sin n)

Published on 20 Feb 2017 - 2:19

220

Views

Hierarchical digraph partition

Published on 25 Mar 2026 - 22:01

679

Views

Can matrices of the form $X^TX$ be more efficiently inverted?

Published on 21 Feb 2017 - 12:12

List Question

Diophantine equation and NP-Completness

NP-Hardness of finding minimal support for $Ax=b$ for $F_2$ implies the same over $F_p$

What is the complexity of given problem?

If $\overline{L}$ is NL-hard, can we infer that $L$ is also NL-hard?

Can a set and its complement have intersection?

Computational complexity of upwind scheme

Notation for: the number of triangles $t$ in graph $G = (V,E)$ dominates its number of edges and vertices

Reference for creative set criterion theorem

Decomposition of a Graph into Linear Forests

How can I prove that n . log n is a time constructible function?

Does (or when does) $O(\log\text{poly}(n)) = O(\text{poly}(\log(n)))$?

Can a problem be undecidable but yet Turing recognizable?

Growth rate of n(sin n)

Hierarchical digraph partition

Can matrices of the form $X^TX$ be more efficiently inverted?

Trending Questions

Popular # Hahtags

Popular Questions