Hottest Questions This Month

6 votes

8 answers

3k views

Advantages of linked lists over arrays?

linked-lists

ratchet freak

4,108

modified May 16 at 11:39

9 votes

1 answer

2k views

Why rectangle packing is NP-hard but maybe not in NP?

np-hard np decision-problem

Jxb

153

modified May 13 at 11:27

10 votes

1 answer

2k views

Would it make sense to use an array of linked lists for a Priority Queue, given a fixed number of priorities?

priority-queues

D.W.♦

140k

modified May 4 at 20:56

3 votes

2 answers

1k views

Length of a regular expression

regular-expressions

Nathaniel

7,154

answered May 17 at 18:59

3 votes

2 answers

771 views

Determining if an NFA accepts an infinite language in polynomial time

regular-languages finite-automata polynomial-time infinity

John L.

33.2k

modified May 10 at 2:52

3 votes

2 answers

1k views

Is this language a context-free language or not?

formal-languages context-free pumping-lemma

John L.

33.2k

modified May 8 at 15:50

8 votes

1 answer

690 views

Conjecture: a half of a pairing context-free language must be a regular language

regular-languages context-free open-problem

user326210

738

modified May 7 at 1:38

2 votes

2 answers

607 views

An α-good tree with n nodes has height O(log n)

asymptotics trees binary-trees

John L.

33.2k

modified May 12 at 1:46

3 votes

2 answers

280 views

Number of Inversions found in Selection sort vs Exchange sort

algorithms sorting python

Kelly Bundy

334

modified May 7 at 21:43

4 votes

2 answers

449 views

Spanning tree - minimum difference between smallest and largest weight

graphs minimum-spanning-tree spanning-trees

Steven

22.8k

modified May 24 at 18:08

3 votes

1 answer

853 views

How does the 'proof' of the Cook-Levin theorem, actually prove the Cook-Levin theorem?

complexity-theory

Moslem

629

modified May 1 at 13:28

2 votes

2 answers

515 views

How can I apply binary search to find two adjacent increasing elements in an unsorted array?

algorithms search-algorithms arrays binary-search

Yves Daoust

3,412

modified May 6 at 11:52

3 votes

2 answers

288 views

Find an upper bound for T(n) = T(n/2) + T(n/2 + 1) using the Substitution Method base case fails

complexity-theory asymptotics runtime-analysis recurrence-relation

John L.

33.2k

modified May 14 at 23:34

1 vote

3 answers

343 views

Finding a DFA for concatenation

finite-automata

Ashwin Ganesan

1,030

modified May 10 at 6:11

4 votes

2 answers

204 views

Similarities and differences between Unit and Bottom types?

programming-languages type-theory

Theodore Norvell

500

modified 15 hours ago

2 votes

1 answer

522 views

Is there an algorithm that in some cases is an improvement of BFS in the same way A* is an improvement of Dijkstra?

algorithms graphs shortest-path

Nathaniel

7,154

modified May 17 at 23:03

5 votes

3 answers

90 views

If $L$ is regular then so is $\{y \mid \exists x \, xyx \in L\}$

regular-languages automata finite-automata

J.-E. Pin

5,925

answered May 19 at 4:31

2 votes

2 answers

312 views

Graph Injective-Homomorphism Problem

graphs colorings

Ashwin Ganesan

1,030

modified May 11 at 7:20

0 votes

2 answers

177 views

How do we check $x ≠ y$ in $PDA$ for $L = \{xy | x, y \in (0 + 1)^*, |x| = |y|, x ≠ y\}?$

computability context-free pushdown-automata

Punia

1

answered May 10 at 1:04

0 votes

1 answer

274 views

Sets of problems in different models of computation and cardinality

turing-machines computability finite-automata pushdown-automata infinity

John L.

33.2k

modified May 23 at 1:38

2 votes

4 answers

242 views

What exactly is pumping length in pumping lemma?

regular-languages automata finite-automata regular-expressions pumping-lemma

gnasher729

24.9k

answered May 8 at 13:56

5 votes

1 answer

161 views

Is the set of languages satisfying the pumping lemma closed under concatenation?

regular-languages pumping-lemma closure-properties

Yuval Filmus

269k

answered May 20 at 12:51

1 vote

2 answers

152 views

Clarification regarding linear boolean functions!

boolean-algebra linear-algebra

Yves Daoust

3,412

modified May 11 at 16:20

3 votes

2 answers

91 views

what are all the domains of computer sciences?

software-engineering

HEKTO

2,952

answered May 11 at 19:53

1 vote

4 answers

71 views

Why is $a^{\log_b n}$ the same as $n^{\log_b a}$?

asymptotics

Yuval Filmus

269k

modified May 7 at 16:05

-1 votes

2 answers

241 views

Maximum difference between maximum and minimum frequency in a subarray

arrays substrings

Arkinbird

3

modified May 16 at 2:56

2 votes

3 answers

113 views

Find the smallest difference between two numbers in a DS in O(1) time

time-complexity data-structures runtime-analysis binary-trees heaps

Subhankar Ghosal

170

answered May 18 at 18:25

0 votes

2 answers

144 views

Finding Median value given a tuple (value, frequency) in O(n) worst case time complexity

time-complexity sorting selection-problem

Russel

1,257

modified May 8 at 4:26

1 vote

1 answer

171 views

Undecidability in optimal data compression

turing-machines undecidability information-theory data-compression

Bruno

306

modified May 5 at 19:16

1 vote

2 answers

158 views

Problem size and how it's different than the input for an algorithm

algorithms

Yves Daoust

3,412

answered May 2 at 8:38

1 vote

1 answer

155 views

Proof that 2-sat is P-hard?

np-hard 3-sat 2-sat

Yuval Filmus

269k

answered May 14 at 15:45

3 votes

1 answer

190 views

Shannon's result that some Boolean functions require exponential circuits

complexity-theory reference-request complexity-classes circuits boolean-complexity

Yuval Filmus

269k

answered May 8 at 17:14

1 vote

2 answers

54 views

Find largest set of players that never played against eachother

algorithms

kviiri

966

answered May 12 at 9:40

2 votes

2 answers

83 views

Are reversed reverse preorder traversals equivalent to a postorder traversal?

binary-trees graph-traversal

Hendrik Jan

27.2k

answered May 20 at 13:49

1 vote

1 answer

213 views

Time complexity when taking certain elements and iterating over them?

big-o-notation

John L.

33.2k

modified May 9 at 1:24

3 votes

1 answer

180 views

Amortized analysis on a dynamic table that grows its size by $\sqrt{size} $

algorithms algorithm-analysis amortized-analysis dynamic-array

John L.

33.2k

modified May 13 at 7:14

2 votes

2 answers

83 views

Exponential Time Hypothesis and the input size vs number of variables

complexity-theory time-complexity satisfiability

rus9384

1,381

answered May 21 at 9:31

2 votes

1 answer

136 views

Disprove: if L is decidable then Prefix(L) is decidable

turing-machines undecidability halting-problem check-my-answer

Mark H

113

modified May 23 at 10:28

2 votes

2 answers

62 views

What is the lower bound on retrieving an item in a collection if no arrays(Random access memory) are allowed?

time-complexity data-structures lambda-calculus functional-programming lower-bounds

pedroth

235

modified May 2 at 18:46

0 votes

3 answers

78 views

How is pipelining possible?

cpu

gnasher729

24.9k

answered May 18 at 11:14

2 votes

1 answer

118 views

Sorted list of counters in constant time

algorithms algorithm-analysis sorting counting constant-time

rici

11k

modified May 13 at 3:38

1 vote

1 answer

135 views

A small issue regarding the proof of Savitch's Theorem

complexity-theory turing-machines space-complexity nondeterminism

Nathaniel

7,154

answered May 22 at 13:49

1 vote

1 answer

133 views

Find a path with given weight and the minimum number of edges on a tree

algorithms time-complexity trees

John L.

33.2k

modified May 2 at 21:47

2 votes

1 answer

214 views

Show all chains per user

algorithms data-structures path

Chen Reddy Sundeep

33

answered May 10 at 18:51

3 votes

1 answer

46 views

Why can't $QBF$ be reduced to $SAT$

reductions satisfiability

Steven

22.8k

modified May 14 at 18:35

1 vote

1 answer

95 views

Proving transitivity in an intuitionistic type theory without the K rule

type-theory functional-programming dependent-types proof-assistants agda

Dan Doel

2,050

answered May 23 at 2:16

0 votes

2 answers

92 views

Maximum subarray sum of given length range

arrays greedy-algorithms maximum-subarray

John L.

33.2k

answered May 7 at 13:59

1 vote

1 answer

88 views

Language of Turing machines that go through some configuration infinitely many times on empty input

formal-languages turing-machines semi-decidability decidability

John L.

33.2k

modified May 11 at 18:59

Top Questions

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