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

0 votes
0 answers
1 view

Defining a process without internal events

12 votes
2 answers
1k views

Is anyone aware of a counter-example to the Dharwadker-Tevet Graph Isomorphism algorithm?

0 votes
0 answers
25 views

Perfect simulation of classical dynamical systems

-2 votes
0 answers
84 views

The Unique Games Conjecture is wrong or the following 1.885903-algorithm for the vertex cover problem?

0 votes
0 answers
38 views

Simplify or bound using Big-O notation

4 votes
0 answers
65 views

Computing permanents when we are promised that the value of the permanent is large

0 votes
0 answers
32 views

Does for every k $\Sigma _k exists Sigma_k complete issue

2 votes
1 answer
154 views

Maximize a special monotone submodular function - is it easier?

1 vote
0 answers
74 views

proof that 2-SAT is P-hard

-1 votes
0 answers
9 views

relevance of a large prime number in polynomial rolling hash function

1 vote
0 answers
32 views
+50

Code indistinguishability assumption for Code based cryptography (in special cases)

0 votes
0 answers
17 views

Round Robin Algorithm ( Process scheduling)

2 votes
0 answers
75 views

Complexity of the Complete (3,2) SAT problem?

1 vote
1 answer
160 views

Are there 'poision-pill' research questions in TCS?

Browse more Questions