User spektr

89

votes

7

answers

20k

views

Why are some programming languages “faster” or “slower” than others?

programming-languages compilers

Nov 21 '19 at 16:10 ghellquist 346

33

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 Community♦ 1

29

votes

2

answers

10k

views

Optimization version of decision problems

complexity-theory optimization search-problem decision-problem

Apr 13 '17 at 18:18 Community♦ 1

18

votes

4

answers

30k

views

What is the difference between finite automata and finite state machines?

terminology automata finite-automata

Jan 27 '20 at 21:32 Sebastian Nielsen 143

13

votes

2

answers

710

views

Matrix chain multiplication and exponentiation

optimization dynamic-programming linear-algebra

May 30 '17 at 21:23 matteyas 46

12

votes

3

answers

3k

views

Optimal strategy for an abstract game

algorithms optimization

May 4 '17 at 5:41 am.rez 101

11

votes

3

answers

10k

views

Modifying Dijkstra's algorithm for edge weights drawn from range $[1,…,K]$

algorithms data-structures shortest-path weighted-graphs

May 6 '18 at 9:01 TIANYANG ZHANG 1

6

votes

1

answer

656

views

Confused between turing-completeness and universal approximation - are they related?

turing-machines approximation neural-networks recursion turing-completeness

Jan 16 '17 at 20:02 D.W.♦ 129k

6

votes

3

answers

1k

views

Interpolation Optimization Problem

optimization

May 3 '17 at 15:57 Community♦ 1

5

votes

2

answers

607

views

Approximate subset sum with two-dimensional vectors

optimization approximation integer-programming quadratic-programming

Jun 4 '17 at 2:33 Community♦ 1

4

votes

1

answer

47

views

How to approach analysis of randomized algorithm

algorithms algorithm-analysis probability-theory randomized-algorithms

May 16 '19 at 16:46 stratified_mess17 43

4

votes

1

answer

58

views

Can the output value be solved and/or written as Taylor expansion?

time-complexity recurrence-relation

Feb 3 '17 at 19:34 Albert Hendriks 2,114

3

votes

4

answers

211

views

Optimization problem where penalty is sensitive to permutation

algorithms optimization permutations

Mar 6 '17 at 15:53 slvrbld 143

3

votes

1

answer

3k

views

Finding the number of intersections of $n$ line segments with endpoints on two parallel lines

algorithms computational-geometry

Mar 4 '18 at 17:19 Community♦ 1

3

votes

1

answer

49

views

When do you use amortized time complexity and when to use unamortized?

time-complexity amortized-analysis

Nov 6 at 17:36 OmG 3,317

3

votes

1

answer

447

views

How much does regularization prevent overfitting?

machine-learning

May 17 '17 at 1:44 yters 1,305

3

votes

1

answer

674

views

Time complexity of computing binomial coefficients (with binary representation of integers)

algorithms time-complexity

Mar 14 '18 at 4:01 xskxzr 6,539

2

votes

1

answer

315

views

Probabilistic r-way cut set algorithm

algorithms complexity-theory graphs probabilistic-algorithms

Dec 25 '19 at 1:01 Community♦ 1

2

votes

3

answers

4k

views

What are the differences between search problems, optimization problems, and decision problems? [closed]

algorithms

May 8 '17 at 8:35 6005 3,910

1

vote

1

answer

928

views

Why is $\log n = O(2^n)$? [duplicate]

asymptotics landau-notation

May 31 '17 at 13:48 Thumbnail 606

1

vote

1

answer

327

views

Algorithm for weighted elliptic curve fit

algorithms image-processing mathematical-programming video

Mar 24 '18 at 1:29 D.W.♦ 129k

1

vote

0

answers

34

views

perceptions of machine learning techniques from different careers?

machine-learning

Jan 24 '17 at 1:20 Layla 403

1

vote

2

answers

142

views

Using Induction to prove that $n^3log^4n=O(n^4)$

asymptotics recurrence-relation induction

Mar 24 '17 at 20:45 ZeroUltimax 762

1

vote

1

answer

18

views

Computational indistinguishability for any distribution using a Chernoff bound

asymptotics probability-theory randomness pseudo-random-generators chernoff-bounds

Feb 22 at 10:01 Yuval Filmus 246k

0

votes

1

answer

419

views

O(n) Palindromic Substring: Why is O(n^2) needed here?

dynamic-programming substrings

May 2 '17 at 5:27 Bolton Bailey 223

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

25 Bookmarks

Why are some programming languages “faster” or “slower” than others?

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

Optimization version of decision problems

What is the difference between finite automata and finite state machines?

Matrix chain multiplication and exponentiation

Optimal strategy for an abstract game

Modifying Dijkstra's algorithm for edge weights drawn from range $[1,…,K]$

Confused between turing-completeness and universal approximation - are they related?

Interpolation Optimization Problem

Approximate subset sum with two-dimensional vectors

How to approach analysis of randomized algorithm

Can the output value be solved and/or written as Taylor expansion?

Optimization problem where penalty is sensitive to permutation

Finding the number of intersections of $n$ line segments with endpoints on two parallel lines

When do you use amortized time complexity and when to use unamortized?

How much does regularization prevent overfitting?

Time complexity of computing binomial coefficients (with binary representation of integers)

Probabilistic r-way cut set algorithm

What are the differences between search problems, optimization problems, and decision problems? [closed]

Why is $\log n = O(2^n)$? [duplicate]

Algorithm for weighted elliptic curve fit

perceptions of machine learning techniques from different careers?

Using Induction to prove that $n^3log^4n=O(n^4)$

Computational indistinguishability for any distribution using a Chernoff bound

O(n) Palindromic Substring: Why is O(n^2) needed here?