Explore our questions

3 votes
3 answers
216 views

A Travelling Salesman variant where the next distance depends on distance travelled so far

1 vote
1 answer
49 views

all k-Vertex Covers

1 vote
0 answers
108 views

Can an $n$-element subset of a $2n$-element set be stored in $2n - \omega(1)$ bits?

1 vote
2 answers
292 views

A few questions about ISWIM

1 vote
3 answers
518 views

Minimum number of triangles required to cover a complete graph?

1 vote
0 answers
76 views

Research masters programs in theoretical computer science (with a focus on complexity theory)

3 votes
1 answer
190 views

What is the relevance of Real Analysis in TCS?

1 vote
2 answers
260 views

Nondeterministic Turing Machines as deciders, versus NP and co-NP

-2 votes
0 answers
51 views

reduction from $permanent _{-1,0,1}$ to $permanent _{0,1,2,3,\dots,n}$

2 votes
0 answers
71 views

Monads whose Kleisli arrows can be "applicativized"

2 votes
0 answers
60 views

References for algorithms to compute approximating polytopes for arbitrary convex sets

0 votes
0 answers
44 views

Is every 4-claw-free graph a bounded degree graph?

-1 votes
0 answers
29 views

converting K-SAT clause to a p-in-L-SAT equation

11 votes
4 answers
1k views

Explaining monad transformers in categorical terms

Browse more Questions