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 2 Bountied Hot Week Month

0

votes

1

answer

68

views

Given $n$ unique items and an $m^{th}$ normalised value, compute $m^{th}$ permutation without factorial expansion

algorithms time-complexity computability recurrence-relation permutations

modified 4 hours ago Community♦ 1

3

votes

1

answer

126

views

Is Blum's theorem for acceptable enumerations of partially computable functions bidirectional?

computability

modified 6 hours ago Community♦ 1

3

votes

1

answer

54

views

Can any computably enumerable set be generated by a prefix-free set?

turing-machines computability

modified 8 hours ago Community♦ 1

1

vote

1

answer

28

views

Determine if for given some $L$, $S_L={L(M) : <M>\in L}$ then for any $L$, if $S_L=RE$ then $L\in R$ is True or False and explain

complexity-theory turing-machines computability counting

modified 20 hours ago John D 125

2

votes

1

answer

4k

views

Is it decidable whether a Turing machine M will reach state q on input s?

turing-machines computability undecidability semi-decidability

modified yesterday Community♦ 1

4

votes

2

answers

106

views

tautology vs satisfiability

complexity-theory turing-machines computability reductions np

answered 2 days ago Highheath 525

0

votes

1

answer

68

views

On the computable function of a problem that halts

turing-machines computability halting-problem

modified 2 days ago Community♦ 1

5

votes

1

answer

79

views

Reduction from the SAT problem to the NAE-SAT problem

complexity-theory computability reductions np satisfiability

answered Jul 26 at 6:48 Shaull 15.6k

1

vote

2

answers

46

views

Reduction between CLIQUE to SUBSET SUM

complexity-theory graphs computability reductions np

modified Jul 26 at 5:47 dustyeav 181

0

votes

1

answer

59

views

Reduction from problem A to another problem B

complexity-theory computability reductions np

answered Jul 25 at 11:47 Steven 17.6k

3

votes

2

answers

50

views

Reduction with CoNP and CoNPC

complexity-theory computability np-complete reductions np

answered Jul 23 at 20:02 Arno 1,684

0

votes

1

answer

31

views

Complications of a language that reaches a state of reject

complexity-theory turing-machines computability reductions np

modified Jul 23 at 16:31 D.W.♦ 133k

2

votes

1

answer

65

views

Reduction from TSP to even TSP

complexity-theory computability reductions np

modified Jul 23 at 16:25 Hedayatullah Sarwary 257

2

votes

1

answer

36

views

Reduction from language in P to another language in NP

complexity-theory time-complexity computability reductions np

modified Jul 23 at 14:50 Arno 1,684

Browse more Questions

Computer Science Stack Exchange works best with JavaScript enabled