Theoretical Computer Science Stack Exchange is a question and answer site for theoretical computer scientists and researchers in related fields. 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

1 vote
0 answers
41 views

Is the Category of $(* \to)^n *$-kinded types freely generated from the discrete graph with $n$ nodes?

1 vote
0 answers
17 views

Find the SVM kernel in detecting if a substring in a given string

-1 votes
0 answers
20 views

corresponding resoving and arbitary resolving

5 votes
1 answer
176 views

What can we do with a generic oracle (as opposed to a random one)?

54 votes
7 answers
4k views

Good examples for how to write well in TCS

3 votes
1 answer
302 views

Online TCS Seminars

2 votes
1 answer
119 views

Can CDCL Algorithm Derived Conflict Clauses Always Be Obtained Through Resolution from an Unsatisfiable CNF Formula?

0 votes
2 answers
57 views

Representing/Modelling fields and methods in the context of programming as automata

-1 votes
0 answers
71 views

Proof for Upper Bound on the Size of the Sum of Rational Numbers

0 votes
1 answer
88 views

Confusion about lower bounds and upper bounds in learning theory

5 votes
2 answers
350 views

Error in Robson's proof about separting strings?

6 votes
3 answers
419 views

Finding a minimal context free grammar that recognizes a finite set of strings of bounded length

2 votes
0 answers
54 views

Enforcing general position in $2d$ linear programming

4 votes
0 answers
107 views

Convex optimization: is it possible to find solutions that are exactly feasible and approximately optimal in polynomial time?

Browse more Questions