List questions from computational-complexity

Published on 25 Mar 2026 - 15:58

264

Views

What does psuedo-polynomial algorithm for subset sum problem mean?

Published on 25 Mar 2026 - 23:35

15.4k

Views

Number of flops required to invert a matrix

Published on 06 Apr 2014 - 15:19

1.9k

Views

Order functions by speed of their asymptotic growths

Published on 07 Apr 2014 - 17:38

149

Views

If $P=NP$, prove that $L' \in NP$

Published on 26 Mar 2026 - 22:52

79

Views

Complexity of finding extremal rays

Published on 08 Apr 2014 - 9:10

36

Views

Can cuts of size 2 be detected in linear time in an undirected, unweighted graph?

Published on 11 Apr 2014 - 17:18

42

Views

How do you find a minimum of a function with these tools?

Published on 12 Apr 2014 - 23:20

97

Views

Existence of a det. poly-time algo for problem $f: X \to Y$.

Published on 13 Apr 2014 - 1:50

443

Views

Is there a way to compute if(i < j) k := (a + b)c with polynomials over $\Bbb{Z}_p$?

Published on 16 Apr 2014 - 7:08

42

Views

circuits complexity

Published on 16 Apr 2014 - 10:42

374

Views

Do there exist polynomials not computable in polynomial time?

Published on 16 Apr 2014 - 19:17

43

Views

Not every polynomial in $\Bbb{Z}_p[x]$ can be factored, but can you do next best?

Published on 27 Mar 2026 - 10:48

47

Views

How do you define computational complexity abstractly?

Published on 17 Apr 2014 - 13:53

93

Views

My notes on $\Bbb{Z}/p\Bbb{Z}$-theoretic computational complexity

Published on 27 Mar 2026 - 0:56

List Question

Prove 2-HamiltonianCycle $\in \textbf{NP}$

What does psuedo-polynomial algorithm for subset sum problem mean?

Number of flops required to invert a matrix

Order functions by speed of their asymptotic growths

If $P=NP$, prove that $L' \in NP$

Complexity of finding extremal rays

Can cuts of size 2 be detected in linear time in an undirected, unweighted graph?

How do you find a minimum of a function with these tools?

Existence of a det. poly-time algo for problem $f: X \to Y$.

Is there a way to compute if(i < j) k := (a + b)c with polynomials over $\Bbb{Z}_p$?

circuits complexity

Do there exist polynomials not computable in polynomial time?

Not every polynomial in $\Bbb{Z}_p[x]$ can be factored, but can you do next best?

How do you define computational complexity abstractly?

My notes on $\Bbb{Z}/p\Bbb{Z}$-theoretic computational complexity

Trending Questions

Popular # Hahtags

Popular Questions