User Juho

287

votes

7

answers

133k

views

What is the definition of P, NP, NP-complete and NP-hard?

Apr 19 at 23:23 Community♦ 1

92

votes

11

answers

21k

views

Solving or approximating recurrence relations for sequences of numbers

asymptotics proof-techniques combinatorics recurrence-relation reference-question

Mar 22 '19 at 17:44 ryan 4,166

72

votes

4

answers

28k

views

(When) is hash table lookup O(1)?

algorithm-analysis data-structures runtime-analysis hash-tables

Dec 29 '15 at 12:07 Community♦ 1

48

votes

4

answers

4k

views

What is the meaning of $O(m+n)$?

terminology asymptotics mathematical-analysis landau-notation

Dec 28 at 15:20 kaba 301

42

votes

4

answers

15k

views

What are common techniques for reducing problems to each other?

complexity-theory computability reductions proof-techniques reference-question

Jan 17 '14 at 18:09 Community♦ 1

40

votes

3

answers

16k

views

Deciding on Sub-Problems for Dynamic Programming

algorithms dynamic-programming

Jul 20 '17 at 4:16 Kamal Rawat 1

37

votes

3

answers

4k

views

Decision problems vs “real” problems that aren't yes-or-no

complexity-theory time-complexity np-hard approximation

Sep 29 '13 at 16:31 Community♦ 1

34

votes

2

answers

11k

views

How do I construct reductions between problems to prove a problem is NP-complete?

complexity-theory np-complete proof-techniques reductions

May 5 '18 at 11:18 nbro 1,082

27

votes

1

answer

16k

views

Is the k-clique problem NP-complete?

complexity-theory graphs np-complete complexity-classes

Nov 24 '12 at 15:19 Raphael♦ 69.1k

27

votes

5

answers

14k

views

Is O(mn) considered “linear” or “quadratic” growth?

terminology asymptotics landau-notation

Feb 7 '13 at 20:34 SamM 1,652

21

votes

1

answer

1k

views

Classification of intractable/tractable satisfiability problem variants

complexity-theory reference-request satisfiability

Apr 14 '12 at 10:19 Community♦ 1

18

votes

3

answers

693

views

Recipe book for SAT encodings?

reference-request satisfiability sat-solvers

Sep 21 '18 at 11:45 Community♦ 1

15

votes

1

answer

2k

views

Planarity conditions for Planar 1-in-3 SAT

np-complete reductions satisfiability 3-sat

Mar 22 '17 at 3:44 sud03r 101

15

votes

2

answers

1k

views

Classfication of randomized algorithms

algorithms terminology randomized-algorithms nondeterminism machine-models

Apr 7 '14 at 14:10 Yuval Filmus 242k

10

votes

1

answer

4k

views

Negative numbers in Subset-Sum

np-complete

Apr 14 at 16:34 Akshat Uppal 1

10

votes

4

answers

5k

views

Evolving artificial neural networks for solving NP problems

machine-learning np neural-networks p-vs-np genetic-algorithms

Oct 31 '19 at 15:14 Yuval Filmus 242k

8

votes

2

answers

2k

views

Providing Tight Example in Approximation Algorithm Analysis

algorithms proof-techniques approximation

Oct 18 '12 at 18:33 Sasho Nikolov 2,467

6

votes

2

answers

1k

views

In computer science how is using passive voice regarded?

research

Oct 31 '14 at 17:48 Community♦ 1

6

votes

2

answers

395

views

Complexity of “given a graph $G$ with vertex $v$, is there a maximum clique containing $v$”?

complexity-theory complexity-classes

Aug 28 '15 at 6:51 Community♦ 1

6

votes

2

answers

862

views

Path finding under constraints

algorithms graphs shortest-path

Apr 12 '14 at 19:10 Community♦ 1

5

votes

2

answers

710

views

Can you solve 2-sat problem when truth assignments of some variables are determined

2-sat

Jan 5 '20 at 21:27 G. Bach 1,978

4

votes

1

answer

89

views

Still not understanding why the Knapsack Problem does NOT have a polynomial-time solution

knapsack-problems

Jun 27 '19 at 17:46 David Richerby 78.5k

4

votes

2

answers

66

views

Books for the Mathematical Theory of AI/ML

machine-learning reference-request artificial-intelligence

Aug 7 at 20:50 Pavel Rahman 11

3

votes

0

answers

276

views

Maximum Weight Independent Set in Circular-Arc Graphs (Proof of A Lemma)

algorithms graphs correctness-proof

Mar 14 '14 at 4:31 Community♦ 1

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

24 Bookmarks

What is the definition of P, NP, NP-complete and NP-hard?

Solving or approximating recurrence relations for sequences of numbers

(When) is hash table lookup O(1)?

What is the meaning of $O(m+n)$?

What are common techniques for reducing problems to each other?

Deciding on Sub-Problems for Dynamic Programming

Decision problems vs “real” problems that aren't yes-or-no

How do I construct reductions between problems to prove a problem is NP-complete?

Is the k-clique problem NP-complete?

Is O(mn) considered “linear” or “quadratic” growth?

Classification of intractable/tractable satisfiability problem variants

Recipe book for SAT encodings?

Planarity conditions for Planar 1-in-3 SAT

Classfication of randomized algorithms

Negative numbers in Subset-Sum

Evolving artificial neural networks for solving NP problems

Providing Tight Example in Approximation Algorithm Analysis

In computer science how is using passive voice regarded?

Complexity of “given a graph $G$ with vertex $v$, is there a maximum clique containing $v$”?

Path finding under constraints

Can you solve 2-sat problem when truth assignments of some variables are determined

Still not understanding why the Knapsack Problem does NOT have a polynomial-time solution

Books for the Mathematical Theory of AI/ML

Maximum Weight Independent Set in Circular-Arc Graphs (Proof of A Lemma)