Question

Using Polynomial-Time Reduction to Prove Hardness

score 386 · Answer 1 · 2026-03-28 03:32:47

386

Views

Using Polynomial-Time Reduction to Prove Hardness

Published on 28 Mar 2026 - 3:32

score 782 · Answer 2 · 2026-03-28 03:33:02

782

Views

Polynomial-Time reduction: Clique Problem

Published on 28 Mar 2026 - 3:33

score 25.8k · Answer 3 · 2012-05-08 07:12:45

25.8k

Views

how do you prove that 3-SAT is NP-complete?

Published on 08 May 2012 - 7:12

score 376 · Answer 4 · 2012-05-08 13:56:33

376

Views

example of complexity class that does not have complete problems

Published on 08 May 2012 - 13:56

score 103 · Answer 5 · 2012-05-08 14:03:36

103

Views

Complexity classes and number of problems

Published on 08 May 2012 - 14:03

score 68 · Answer 6 · 2012-05-09 01:20:47

68

Views

Complexity class that is the set of languages expressible by first-order logic

Published on 09 May 2012 - 1:20

score 114 · Answer 7 · 2012-05-09 04:01:00

114

Views

Descriptive Complexity Theory - operator, structure and iteration?

Published on 09 May 2012 - 4:01

score 6.8k · Answer 8 · 2012-05-09 22:50:38

6.8k

Views

Big-O notation always holds for this two functions?

Published on 09 May 2012 - 22:50

score 121 · Answer 9 · 2012-05-10 14:42:48

121

Views

Time to resolve a problem of size $1000$ in one second, how time take resolve the same problem of size $10.000$ in $n^2$?

Published on 10 May 2012 - 14:42

score 195 · Answer 10 · 2026-04-06 00:24:18

195

Views

LFP - shortest path problem

Published on 06 Apr 2026 - 0:24

score 746 · Answer 11 · 2012-05-11 00:09:07

746

Views

Form or asymptotic behaviour of $T(n) =2T(n-1)+n$

Published on 11 May 2012 - 0:09

score 33 · Answer 12 · 2012-05-11 08:12:30

33

Views

size of first-order formulae to express a property

Published on 11 May 2012 - 8:12

score 100 · Answer 13 · 2012-05-11 10:16:36

100

Views

non-complete problem collapsing to a lower complexity class complete problem

Published on 11 May 2012 - 10:16

score 129 · Answer 14 · 2012-05-20 03:20:56

129

Views

Do the complete areas of various complexity classes have infinitely many problems?

Published on 20 May 2012 - 3:20

score 69 · Answer 15 · 2012-05-20 07:14:22

69

Views

RE problems that are neither RE-complete nor recursive

Published on 20 May 2012 - 7:14

List Question

Using Polynomial-Time Reduction to Prove Hardness

Polynomial-Time reduction: Clique Problem

how do you prove that 3-SAT is NP-complete?

example of complexity class that does not have complete problems

Complexity classes and number of problems

Complexity class that is the set of languages expressible by first-order logic

Descriptive Complexity Theory - operator, structure and iteration?

Big-O notation always holds for this two functions?

Time to resolve a problem of size $1000$ in one second, how time take resolve the same problem of size $10.000$ in $n^2$?

LFP - shortest path problem

Form or asymptotic behaviour of $T(n) =2T(n-1)+n$

size of first-order formulae to express a property

non-complete problem collapsing to a lower complexity class complete problem

Do the complete areas of various complexity classes have infinitely many problems?

RE problems that are neither RE-complete nor recursive

Trending Questions

Popular # Hahtags

Popular Questions