As of May 31, 2023, we have updated our Code of Conduct.

Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. 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
22 views

Best method to run an optimizing function millions of times

25 votes
7 answers
18k views

Why is encrypting with the same one-time-pad not good?

1 vote
1 answer
37 views

Could someone give me an example of MaxSat's approximable 1/2 algorithm?

1 vote
1 answer
132 views

Is it possible to create a NFA that accepts only n*"a" or n*"b" inputs?

0 votes
2 answers
76 views

Show for every $CFL$ $L$ that's not $REG$ exists $L_1,L_2$ with $L_1$ is $REG$ and $L_1 \subseteq L_2$ and $L_2$ is not $REG$ and $L \subseteq L_2$

0 votes
0 answers
11 views

How do I format numbers I printed out from iterating over a multidimensional array in python?

0 votes
0 answers
9 views

Shell sort algorithm analysis

1 vote
1 answer
635 views

Minimum distance of nodes from a set of two nodes

2 votes
1 answer
33 views

How Can the Bounded Search Tree Algorithm for Closest String run in $\mathcal{O}(kd)$ per node?

0 votes
0 answers
5 views

I/O Complexity Analysis with Memory Hierarchies

0 votes
0 answers
16 views

Random process on ternary string

2 votes
0 answers
14 views

Partition a graph into connected subgraphs of 3 vertices each

4 votes
0 answers
52 views

Finding partition of a graph into connected subgraphs with bounded size and no disconnected vertices

0 votes
1 answer
49 views

About a possible optimized version of Johnson's algorithm on a DAG with "elementary circuits"

Browse more Questions