Question

Why can you find a $k$-clique in polynomial time, but determining if there is a $k$-clique is NP-complete?

score 1.7k · Answer 1 · 2014-02-12 03:00:55

1.7k

Views

Why can you find a $k$-clique in polynomial time, but determining if there is a $k$-clique is NP-complete?

Published on 12 Feb 2014 - 3:00

score 193 · Answer 2 · 2014-02-12 19:24:30

193

Views

The result of O(f(n)) - O(f(n))

Published on 12 Feb 2014 - 19:24

score 5.3k · Answer 3 · 2014-02-13 23:03:40

5.3k

Views

Efficient Verification for Travelling Salesman Problem

Published on 13 Feb 2014 - 23:03

score 133 · Answer 4 · 2014-02-18 19:25:42

133

Views

A Matrix Optimization Problem

Published on 18 Feb 2014 - 19:25

score 782 · Answer 5 · 2014-02-19 06:51:24

782

Views

How to prove $n^2$ is not in $n^3$

Published on 19 Feb 2014 - 6:51

score 30 · Answer 6 · 2014-02-19 17:47:37

30

Views

BigOh - How to determine the upper bound dealing with eccentric series?

Published on 19 Feb 2014 - 17:47

score 56 · Answer 7 · 2014-02-22 09:23:30

56

Views

Is anything nontrivial known about quotients of complexity classes?

Published on 22 Feb 2014 - 9:23

score 67 · Answer 8 · 2014-02-27 05:18:22

67

Views

Proof of a lemma with inequalities

Published on 27 Feb 2014 - 5:18

score 63 · Answer 9 · 2014-03-03 23:37:33

63

Views

Natural Decision Problem not in PTIME

Published on 03 Mar 2014 - 23:37

score 3.1k · Answer 10 · 2014-03-06 03:25:57

3.1k

Views

Calculating run times of programs with asymptotic notation

Published on 06 Mar 2014 - 3:25

score 158 · Answer 11 · 2014-03-06 18:41:03

158

Views

How to find a set of ascending natural numbers which when added to another set of ascending natural numbers sums to a certain number

Published on 06 Mar 2014 - 18:41

score 102 · Answer 12 · 2014-03-06 19:02:39

102

Views

Max Word Size as a Function of Number of Words

Published on 06 Mar 2014 - 19:02

score 123 · Answer 13 · 2014-03-08 14:00:49

Find whether $f(n) = O(g(n))$, $f(n) = \Omega(g(n))$ or $f(n) = \Theta(g(n))$ if $f(n) = n^\frac{1+\sin(\frac{n\pi}{2})}{2}$ and $g(n) = \sqrt{n}$.

score 243 · Answer 14 · 2014-03-08 21:57:57

243

Views

3-SAT vs P/poly

Published on 08 Mar 2014 - 21:57

score 154 · Answer 15 · 2026-04-03 01:42:14

154

Views

Polytime implementation of Discrete Log using primitive recursive functions

Published on 03 Apr 2026 - 1:42

List Question

Why can you find a $k$-clique in polynomial time, but determining if there is a $k$-clique is NP-complete?

The result of O(f(n)) - O(f(n))

Efficient Verification for Travelling Salesman Problem

A Matrix Optimization Problem

How to prove $n^2$ is not in $n^3$

BigOh - How to determine the upper bound dealing with eccentric series?

Is anything nontrivial known about quotients of complexity classes?

Proof of a lemma with inequalities

Natural Decision Problem not in PTIME

Calculating run times of programs with asymptotic notation

How to find a set of ascending natural numbers which when added to another set of ascending natural numbers sums to a certain number

Max Word Size as a Function of Number of Words

Find whether $f(n) = O(g(n))$, $f(n) = \Omega(g(n))$ or $f(n) = \Theta(g(n))$ if $f(n) = n^\frac{1+\sin(\frac{n\pi}{2})}{2}$ and $g(n) = \sqrt{n}$.

3-SAT vs P/poly

Polytime implementation of Discrete Log using primitive recursive functions

Trending Questions

Popular # Hahtags

Popular Questions