Computer Science Stack Exchange

0 votes

2 answers

29 views

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

Subhankar Ghosal

298

answered 4 hours ago

2 votes

1 answer

318 views

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

CommunityBot

1

modified 12 hours ago

2 votes

1 answer

60 views

Lower Bound on Parity of Boolean Functions

CommunityBot

1

modified 14 hours ago

0 votes

3 answers

358 views

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

Gary Drocella

66

modified yesterday

-2 votes

0 answers

22 views

why doesn't 2SAT proof work on 3SAT

ChadTheVlad

3

asked yesterday

1 vote

1 answer

19 views

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

Yuval Filmus

275k

answered Dec 2 at 13:41

0 votes

1 answer

48 views

Reductions to perfect matching

CommunityBot

1

modified Dec 2 at 7:04

0 votes

1 answer

20 views

Variant of Bounded Subset Product

adelta

1

modified Nov 30 at 23:22

1 vote

1 answer

84 views

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

CommunityBot

1

modified Nov 30 at 21:06

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)

gnasher729

28.4k

answered Nov 30 at 14:07

1 vote

1 answer

48 views

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

JimN

771

modified Nov 30 at 7:46

1 vote

2 answers

57 views

Complexity of satisfiability for relational logic on the booleans

user1868607

2,184

answered Nov 29 at 14:32

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?

D.W.♦

156k

answered Nov 28 at 5:39

1 vote

1 answer

47 views

GNI public coin interactive proof: why randomize y?

CommunityBot

1

modified Nov 27 at 2:08

Stack Exchange Network

Explore our questions

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

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

Lower Bound on Parity of Boolean Functions

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

why doesn't 2SAT proof work on 3SAT

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

Reductions to perfect matching

Variant of Bounded Subset Product

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

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

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

Complexity of satisfiability for relational logic on the booleans

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

GNI public coin interactive proof: why randomize y?

Hot Network Questions