Explore our questions

1 vote
2 answers
270 views

A few questions about ISWIM

1 vote
3 answers
506 views

Minimum number of triangles required to cover a complete graph?

0 votes
0 answers
63 views

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

1 vote
0 answers
41 views

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

3 votes
1 answer
177 views

What is the relevance of Real Analysis in TCS?

0 votes
2 answers
252 views

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

-1 votes
0 answers
44 views

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

2 votes
0 answers
63 views

Monads whose Kleisli arrows can be "applicativized"

2 votes
0 answers
50 views

References for algorithms to compute approximating polytopes for arbitrary convex sets

0 votes
0 answers
43 views

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

0 votes
0 answers
27 views

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

11 votes
4 answers
1k views

Explaining monad transformers in categorical terms

1 vote
0 answers
31 views

all k-Vertex Covers

1 vote
0 answers
133 views

3-clauses from the 3CNF when sufficiently large, has already less than $\epsilon$ fraction of satisfying assignments

Browse more Questions