Computer Science Stack Exchange

1

vote

2

answers

12

views

Is SAT sparse? Is this an understood problem?

complexity-theory reductions

answered 14 mins ago djechlin 344

2

votes

1

answer

62

views

Prove this langage isn't regular using the pumping lemma

regular-languages automata pumping-lemma

modified 1 hour ago Simon 14

-1

votes

2

answers

99

views

Variant of Turing machine

turing-machines computation-models simulation

modified 1 hour ago Raphael♦ 44.9k

2

votes

2

answers

26

views

Algorithm to reconstruct sentence from shuffled string

algorithms strings

modified 1 hour ago Raphael♦ 44.9k

0

votes

1

answer

31

views

Context-free Language - Pumping Lemma?

formal-languages context-free pumping-lemma

modified 1 hour ago Raphael♦ 44.9k

5

votes

0

answers

31

views

What are these tree transformations called?

data-structures terminology trees binary-trees

modified 1 hour ago Raphael♦ 44.9k

1

vote

1

answer

19

views

Algorithm for finding largest subset with equal number of even and odd elements

algorithms

modified 2 hours ago Yuval Filmus 124k

3

votes

1

answer

15

views

Fitting a low-degree polynomial to a function on a finite 1d grid - a combinatorial problem?

optimization approximation polynomials error-estimation

answered 3 hours ago einpoklum 156

1

vote

0

answers

5

views

Decision problem 3SAT and Bip[3-1]

graph-theory np-hard decision-problem 3-sat

modified 3 hours ago Yuval Filmus 124k

3

votes

1

answer

51

views

Sorting a list of strings in lexicographic order of sorted strings

algorithms sorting

answered 5 hours ago D.W.♦ 57.8k

0

votes

1

answer

892

views

Is my proof for a context free language correct? Same number of a's as b's

formal-languages context-free formal-grammars proof-techniques

modified 5 hours ago talha 1

4

votes

1

answer

39

views

What are applications of computational models beyond P?

complexity-theory

answered 6 hours ago Lieuwe Vinkhuijzen 2,555

0

votes

0

answers

19

views

Is this depth-first top-down parsing algorithm a recursive descent top-down parsing algorithm?

parsers

modified 6 hours ago kate 159

1

vote

2

answers

129

views

Using Dijkstra to find shortest path in relation to two weight functions?

shortest-path weighted-graphs

modified 7 hours ago Yuval Filmus 124k

Nov	DEC	Jan
	18
2015	2016	2017

current community

your communities

more stack exchange communities

Explore Our Questions

Is SAT sparse? Is this an understood problem?

Prove this langage isn't regular using the pumping lemma

Variant of Turing machine

Algorithm to reconstruct sentence from shuffled string

Context-free Language - Pumping Lemma?

What are these tree transformations called?

Algorithm for finding largest subset with equal number of even and odd elements

Fitting a low-degree polynomial to a function on a finite 1d grid - a combinatorial problem?

Decision problem 3SAT and Bip[3-1]

Sorting a list of strings in lexicographic order of sorted strings

Is my proof for a context free language correct? Same number of a's as b's

What are applications of computational models beyond P?

Is this depth-first top-down parsing algorithm a recursive descent top-down parsing algorithm?

Using Dijkstra to find shortest path in relation to two weight functions?

Visit Chat

Hot Network Questions