Computer Science Stack Exchange

4

votes

1

answer

29

views

Factoring algorithms after number field sieves

algorithms reference-request quantum-computing factoring

answered 3 mins ago user1271772 119

1

vote

0

answers

16

views

$L=\{<M>|L(M)\text{ is undecidable}\}$

formal-languages turing-machines undecidability church-turing-thesis

modified 56 mins ago Frank 111

0

votes

0

answers

7

views

$A \leq_p {\overline{A}} \Leftrightarrow {\overline{A}} \leq_p A$

turing-machines reductions polynomial-time-reductions

asked 1 hour ago Frank 111

0

votes

0

answers

9

views

C++: will copy constructor and overload constructor be called simultaneously?

c++

asked 1 hour ago proX 19

0

votes

1

answer

21

views

Reference for counting the number of paths in a DAG

reference-request dag

answered 1 hour ago Aaron Rotenberg 2,954

5

votes

1

answer

209

views

P vs. NP and Godel's Theorems

complexity-theory np-hard p-vs-np

modified 1 hour ago Community♦ 1

4

votes

2

answers

134

views

Is it necessary for NP problems to be decision problems?

algorithms np p-vs-np

modified 2 hours ago Ciro Santilli 郝海东冠状病六四事件法轮功 521

3

votes

3

answers

7k

views

Is every subset of a decidable set, also decidable?

computability undecidability closure-properties sets

answered 4 hours ago Frank 111

21

votes

4

answers

1k

views

Algorithm to test whether a language is context-free

algorithms formal-languages context-free decision-problem

modified 5 hours ago greybeard 677

0

votes

3

answers

98

views

Time complexity for concatenating strings

algorithms algorithm-analysis big-o-notation

answered 6 hours ago gnasher729 19.4k

-1

votes

0

answers

11

views

Smodels Algorithm, Stuck in Loop

algorithms

asked 6 hours ago Micha 1

3

votes

2

answers

81

views

Spanning tree in a graph of intersecting sets

graphs sets minimum-spanning-tree finite-sets

modified 7 hours ago John L. 23.4k

0

votes

1

answer

113

views

How to prove the optimization version problem (whose decision version is NP-complete) can be solved in poly-time iff P=NP?

complexity-theory time-complexity optimization np-complete np-hard

modified 7 hours ago Community♦ 1

Jun	JUL	Aug
	25
2019	2020	2021

Stack Exchange Network

current community

your communities

more stack exchange communities

Explore our Questions

Factoring algorithms after number field sieves

$L=\{<M>|L(M)\text{ is undecidable}\}$

$A \leq_p {\overline{A}} \Leftrightarrow {\overline{A}} \leq_p A$

C++: will copy constructor and overload constructor be called simultaneously?

Reference for counting the number of paths in a DAG

P vs. NP and Godel's Theorems

Is it necessary for NP problems to be decision problems?

Is every subset of a decidable set, also decidable?

Algorithm to test whether a language is context-free

Time complexity for concatenating strings

Smodels Algorithm, Stuck in Loop

Spanning tree in a graph of intersecting sets

How to prove the optimization version problem (whose decision version is NP-complete) can be solved in poly-time iff P=NP?

Hot Network Questions