Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.

Sign up to join this community

Anybody can ask a question

Anybody can answer

The best answers are voted up and rise to the top

Explore our Questions

Ask Question

more tags

Active Hot Week Month

0

votes

1

answer

32

views

Question concerning subset sum problem: split into 3 equal subsets

dynamic-programming

modified 54 mins ago Simon 233

0

votes

0

answers

4

views

How does Gradient Descent treat multiple features?

machine-learning gradient-descent

asked 1 hour ago alexandrosangeli 1

0

votes

1

answer

35

views

Mapping categorical data in K-nearest neighbour

machine-learning classification

modified 2 hours ago Community♦ 1

2

votes

1

answer

68

views

Why, intuitively, does the Ackermann function require $\mu$-minimisation?

computability recursion

modified 3 hours ago Steven 11.8k

1

vote

0

answers

11

views

Binary ↔ Gray permutation matrix

algorithms graphs data-structures combinatorics permutations

asked 3 hours ago mavzolej 177

5

votes

0

answers

157

views

Where is simply typed lambda calculus on the Chomsky hiererchy?

computability lambda-calculus chomsky-hierarchy

modified 3 hours ago lemontree 634

1

vote

0

answers

8

views

Algorithm to sample high-dimensional parameter space of expensive cost function

algorithms sampling monte-carlo

asked 3 hours ago fuenfundachtzig 111

0

votes

1

answer

14

views

substitution method on T(n) = T(floor(n/2)) + n recurrence

algorithm-analysis runtime-analysis recurrence-relation

answered 4 hours ago Inuyasha Yagami 875

0

votes

1

answer

46

views

Help with Linear recurrence relation with balanced partition

algorithms complexity-theory

modified 4 hours ago Community♦ 1

0

votes

0

answers

11

views

Finding time complexity of a depth first traversal algorithm with a depth limit to get all node traversals starting from the root node

algorithms time-complexity graph-traversal depth-first-search

asked 4 hours ago Ashera 13

3

votes

3

answers

5k

views

Using Myhill-Nerode to prove a language is non-regular

formal-languages regular-languages

modified 6 hours ago Shreesh 4,607

11

votes

7

answers

5k

views

How can a computer deal with real numbers

real-numbers computer-algebra

modified 7 hours ago Andrey Tyukin 196

0

votes

0

answers

19

views

Recurrence relations and the Master Theorem

recurrence-relation master-theorem

asked 7 hours ago kasra 53

0

votes

1

answer

17

views

$Sat(EG^2\alpha)$ as a fixpoint of an operator

model-checking computation-tree-logic

answered 8 hours ago Xugui Manuel 19

Browse more Questions

Computer Science Stack Exchange works best with JavaScript enabled