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

3 votes
1 answer
73 views

Assignment problem for forming pairs of real numbers

1 vote
0 answers
54 views

Constructing lossless conductors using zigzag product - a doubt

2 votes
1 answer
93 views

Shortest Common Supersequence of Permutations

8 votes
1 answer
272 views

Complexity of permanent verification

3 votes
1 answer
76 views

Sorting multiple columns of a matrix

3 votes
0 answers
113 views

Exploding number of homomorphisms

0 votes
1 answer
165 views

An additive combinatoric probability question

0 votes
0 answers
41 views

Designing Experiments

3 votes
0 answers
105 views

Cover all triangles of a graph with n subgraphs as small as possible

3 votes
0 answers
95 views

Influence for boolean functions on larger domains

1 vote
0 answers
41 views

What are the fastest known parameterized algorithms for Grid Tiling?

13 votes
1 answer
204 views

Combinatorics of a badminton tournament

0 votes
0 answers
35 views

Let $C$ be collection of subsets of $[N]$. Given, $n\in [N]$, what's the terminology for $card\{s\subseteq [N]\mid n\not \in s,\, s \cup\{n\}\in C\}$?

2 votes
0 answers
21 views

Bound on line with minimum zone complexity in a line arrangement

Browse more Questions