Hottest Questions This Week

24

votes

5

answers

7k

views

P = NP clarification

np-complete p-vs-np

answered Feb 13 at 17:37 Eugen 19

0

votes

5

answers

554

views

Why did a tradition to add a must-use default array to functions was created and endured in many programming languages?

functional-programming

modified 3 hours ago Martin Rosenau 205

5

votes

1

answer

559

views

Is there a name for the class of algorithms that are the most efficient for a particular task?

algorithms time-complexity kolmogorov-complexity

modified 16 hours ago Feynmanfan85 153

1

vote

2

answers

229

views

There exists an algorithm to find grammar of complement of a function?

formal-languages formal-grammars

answered 17 hours ago Max 313

2

votes

2

answers

307

views

Count number of pairs of elements whose product is a perfect square

algorithms dynamic-programming combinatorics linear-algebra

modified 12 hours ago gnasher729 17k

0

votes

4

answers

161

views

Why, in general, must function declarations be followed by a parameter set? [duplicate]

compilers interpreters pseudocode code-generation user-interface

answered 4 hours ago Pseudonym 11.2k

0

votes

1

answer

416

views

Given a set of points in the plane all laying on the axis, find the number of right angled triangles

algorithms computational-geometry mathematical-programming

modified 21 hours ago Alia Siddiqui 1

1

vote

1

answer

62

views

How to show that a $\log_2(x)$ is a recursive function?

computability recursion primitive-recursion

modified 2 days ago Mint 172

2

votes

2

answers

88

views

Easy-to-describe example of uncomputable function

turing-machines computability

modified Feb 13 at 21:04 vonbrand 9,963

0

votes

0

answers

139

views

+100

Time complexity of insertion in linked list

sorting linked-lists

modified yesterday Vimal Patel 473

0

votes

2

answers

76

views

Why L' is not regular?

automata regular-languages regular-expressions closure-properties

answered yesterday NimaKimi 174

0

votes

2

answers

41

views

There are functions with f (n) = f (2n) which can't be calculated

turing-machines computability church-turing-thesis

answered Feb 13 at 3:04 vonbrand 9,963

1

vote

1

answer

52

views

Being stuck and frustrated with my masters project

algorithms machine-learning artificial-intelligence neural-networks mathematical-programming

modified 2 days ago narek Bojikian 3,311

1

vote

2

answers

48

views

NP-complete problem whose corresponding optimization problem is not NP-hard

complexity-theory

answered yesterday vonbrand 9,963

3

votes

1

answer

35

views

Matching two sets when you cannot do within-set comparisons

algorithms

answered Feb 12 at 18:15 Yonatan N 456

0

votes

0

answers

90

views

Strings that do not contain 11 as a substring

regular-languages regular-expressions

modified Feb 11 at 2:22 John L. 20.7k

3

votes

2

answers

32

views

Greedy heuristic for buying fewest fridges of set temperature for products that can be kept in some temp. ranges?

greedy-algorithms

modified yesterday Throckmorton 696

2

votes

1

answer

39

views

Special Monotone SAT problem: NP complete?

complexity-theory np-complete satisfiability

modified Feb 10 at 22:34 D.W.♦ 115k

2

votes

1

answer

36

views

Algorithm to enumerate all complete schedulings of finals tests?

algorithms scheduling

answered yesterday D.W.♦ 115k

-1

votes

1

answer

74

views

Help with designing the following algorithm to prepare chocolate

algorithms linear-programming c

modified Feb 14 at 0:29 Raghunath 1

0

votes

2

answers

44

views

To calculate how many times a certain year repeats itself in the calendar within a given year range

efficiency counting

answered Feb 14 at 10:40 gnasher729 17k

2

votes

1

answer

30

views

Combining merge sort with insertion sort - Time complexity

algorithms

modified yesterday entropyfeverone 101

0

votes

1

answer

37

views

Obtaining an acyclic graph by removing edges using an algorithm that decides ACYCLIC

algorithms complexity-theory graphs np-complete decision-problem

modified Feb 12 at 21:02 pseudoturing 73

3

votes

1

answer

28

views

Slowest growing upper bound for the minimum length of a complementary prefix regular expression

regular-languages finite-automata regular-expressions

answered Feb 11 at 0:49 D.W.♦ 115k

2

votes

0

answers

58

views

Is it true that if $M : \forall \alpha . \left( \alpha \rightarrow \alpha \right)$ is a closed term then $M = \Lambda \alpha. \lambda x^{\alpha} . x$?

lambda-calculus

modified Feb 14 at 6:08 임기정 21

2

votes

2

answers

35

views

How to learn how CPU works in details

cpu

answered yesterday Pseudonym 11.2k

1

vote

1

answer

34

views

Connection between vertex cover and P=NP

complexity-theory turing-machines computability np-hard vertex-cover

modified 20 hours ago STanja 136

2

votes

0

answers

56

views

Counting triplets from three arrays satisfying the equation x^2 = yz

data-structures number-theory counting mathematical-programming

modified Feb 12 at 3:06 UrbanCentral 21

1

vote

1

answer

43

views

Good algorithm to find all pairs of strings between 2 sets so that all words from the 1st string are all contained in the 2nd string?

strings sets substrings

answered Feb 14 at 1:30 D.W.♦ 115k

0

votes

1

answer

33

views

Solving a peculiar recurence relation

algorithms asymptotics runtime-analysis recurrence-relation master-theorem

answered yesterday D.W.♦ 115k

0

votes

1

answer

42

views

Is this a CFL: $L_1 = \{wxyx | w, x, y \in (0 + 1)^+\}$?

context-free pushdown-automata

modified Feb 11 at 17:02 gnasher729 17k

2

votes

1

answer

30

views

minimizing the maximum between a degree of a tree and its height

asymptotics trees

modified Feb 11 at 21:32 John L. 20.7k

1

vote

1

answer

27

views

Distinction between 2 languages.One is regular the other is not

automata regular-languages finite-automata pumping-lemma

answered Feb 12 at 14:25 Aaron Rotenberg 2,214

0

votes

1

answer

27

views

Reservoir Sampling vs Round Robin

probability-theory randomness

modified yesterday user3494047 171

1

vote

1

answer

42

views

Is there a defined set of steps or principles on how to reduce time complexity of algorithms?

algorithms time-complexity optimization

answered Feb 13 at 10:07 Laakeri 1,151

0

votes

1

answer

42

views

A linear time algorithm to find the array of indices of bigger numbers

algorithms

answered 17 hours ago Daniel 361

1

vote

1

answer

25

views

Proving the regularity of the following language

formal-languages regular-languages

modified 2 days ago roctothorpe 938

0

votes

1

answer

19

views

Equivalent regular grammar with minimum number of nonterminals

formal-languages regular-languages

answered Feb 10 at 22:50 rici 6,188

1

vote

0

answers

39

views

What are precisely computational effects?

terminology

asked yesterday Harry 11

1

vote

1

answer

29

views

Use the pumping lemma to show it's not regular

formal-languages regular-languages pumping-lemma

answered Feb 11 at 4:42 Yuval Filmus 217k

1

vote

1

answer

22

views

Is the sieve an improvement for prime finding over an optimized algorithm?

algorithms algorithm-analysis time-complexity

modified Feb 12 at 17:27 gnasher729 17k

0

votes

0

answers

36

views

Help with binary tree that allows duplicate values and returns number of nodes larger/smaller than entered value [closed]

algorithms binary-trees binary-search-trees c avl-trees

asked Feb 11 at 12:39 noobcoder 9

0

votes

0

answers

36

views

Is this proof for pumping lemma legit?

automata regular-languages pumping-lemma

modified Feb 11 at 20:14 Hans Hüttel 2,305

0

votes

1

answer

36

views

Integer Linear programming formulation if then condition

optimization linear-programming integer-programming constraint-programming

answered Feb 12 at 15:07 Saad Balbiyad 76

0

votes

2

answers

28

views

How are Operating systems involved in execution of programs?

operating-systems

modified yesterday entropyfeverone 101

0

votes

1

answer

21

views

Does input space size contribute at all to the runtime of an algorithm?

algorithms complexity-theory

answered Feb 11 at 0:39 D.W.♦ 115k

2

votes

1

answer

21

views

The PDA have to finish reading the input?

automata

answered yesterday Ravi Kumar 21

1

vote

1

answer

20

views

How many snakes there can be in the “snakes and ladders” game?

algorithms discrete-mathematics board-games

answered Feb 13 at 12:54 gandalf61 1,248

Top Questions

Looking for more? Browse the complete list of questions, or popular tags. Help us answer unanswered questions.