Computer Science
Subhankar Ghosal's user avatar
Subhankar Ghosal's user avatar
Subhankar Ghosal's user avatar
Subhankar Ghosal
  • Member for 9 years, 11 months
  • Last seen more than a month ago
  • Howrah, West Bengal, India
Profile Activity
Stats
298
reputation
2k
reached
9
answers
6
questions
Communities
View all
About

I am a PhD fellow in Indian Statistical Institute in Computer Science. I love Math, Computer Science, Statistics and Physics.

Badges
This user doesn’t have any gold badges yet.
2
silver badges
8
bronze badges
Top tags
View all tags
5
Score
3
Posts
20
Posts %
5
Score
3
Posts
20
Posts %
4
Score
1
Posts
7
Posts %
1
Score
2
Posts
13
Posts %
0
Score
4
Posts
27
Posts %
0
Score
3
Posts
20
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
4
Find the smallest difference between two numbers in a DS in O(1) time
May 18, 2022
question
3
Best algorithm to calculate the integer partition number
Mar 5, 2022
question
3
Given the optimal coloring of a graph how will we find the optimal coloring of its complement graph?
Apr 28, 2022
question
2
Does any graph based optimization problem, which have a greedy algorithm, has guarantee that there exist an order which give the optimum
Mar 20, 2021
question
2
Consequence of having a randomised algorithm for graph colouring, which shows Yes and No with probability $1$ and $p(n) \sim_{n} 1$
Apr 17, 2022
question
1
How to generate all possible colour vectors generated by greedy colouring on a graph?
Mar 21
answer
1
What is the lower bound on retrieving an item in a collection if no arrays(Random access memory) are allowed?
May 2, 2022
answer
1
how to find the depth of a concurrency bug
Sep 5, 2022
question
0
Is there any proof that says "For each problem in NP there is a randomized algorithm that solves that problem in expected polynomial time."
Feb 12, 2021
answer
0
Inversion array of a given array
Aug 9, 2022
Top network posts
View all network posts
8
One observation of special type of square matrix exponentiation
5
What is the chromatic number of the Erdős–Rényi graph G(n,d/n) when d < 1?

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.