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
2 answers
29 views

How to compute the complexity of $T(n) = 2T(\frac{n}{2}) +O(n\log n)$

2 votes
1 answer
318 views

what are the performance differnces (space and time complexity) between count-min sketch and quotient filter?

2 votes
1 answer
60 views

Lower Bound on Parity of Boolean Functions

0 votes
3 answers
358 views

Does the use of True randomness work in this proof for P does not equal NP

-2 votes
0 answers
22 views

why doesn't 2SAT proof work on 3SAT

1 vote
1 answer
19 views

How is $\mathsf{RP\cap UP}$ not a class containing only unsatisfying languages?

0 votes
1 answer
48 views

Reductions to perfect matching

0 votes
1 answer
20 views

Variant of Bounded Subset Product

1 vote
1 answer
84 views

What is the complexity of problems with randomized polynomial time verification?

0 votes
1 answer
26 views

Determine if all the continuous subsequences of an array contain at least one unique element in O(n lgn)

1 vote
1 answer
48 views

What are the necessary requirements for proving NP is closed under complement?

1 vote
2 answers
57 views

Complexity of satisfiability for relational logic on the booleans

0 votes
1 answer
26 views

What is the largest "allowed" seed for a PRNG to not give any extra power to a deterministic machine?

1 vote
1 answer
47 views

GNI public coin interactive proof: why randomize y?

Browse more Questions