Tour
About Us
Meta
Loading…
current community
Stack Exchange
chat
Meta Stack Exchange
your communities
Sign up
or
log in
to customize your list.
more stack exchange communities
company blog
Log in
Stack Exchange
All Sites
Top Users
Digests
SamiD
Chennai, India
http://www.cmi.ac.in/~sdatta
Professor@CMI $\in$ Complexity
top
accounts
reputation
activity
subscriptions
Top Questions
18
votes
Time complexity of counting triangles in planar graphs
reference-request
graph-algorithms
planar-graphs
asked Mar 15, 2015 at 21:00
cstheory.stackexchange.com
17
votes
The complexity of counting simple paths in a directed graph
ds.algorithms
reference-request
counting-complexity
asked Sep 7, 2014 at 15:44
cstheory.stackexchange.com
13
votes
Minimum Tree-width of circuit for MAJORITY
reference-request
complexity-classes
circuit-complexity
treewidth
asked Oct 10, 2014 at 12:44
cstheory.stackexchange.com
9
votes
What is wrong with this $\mathsf{L} \subseteq \mathsf{L}-$uniform $\mathsf{NC}^1$ argument?
cc.complexity-theory
graph-algorithms
complexity-classes
descriptive-complexity
finite-model-theory
asked Oct 28, 2013 at 3:38
cstheory.stackexchange.com
9
votes
Exact complexity of a problem in $\cap_{m \geq 2}\mathsf{AC}^0[m]$
reference-request
complexity-classes
circuit-complexity
upper-bounds
asked Oct 30, 2013 at 21:14
cstheory.stackexchange.com
8
votes
Complexity of Polynomial Division
cc.complexity-theory
circuit-complexity
arithmetic-circuits
asked Oct 23, 2013 at 20:26
cstheory.stackexchange.com
7
votes
Deterministic Parallel Algorithm for ILP with small number of variables and small coefficients
cc.complexity-theory
circuit-complexity
optimization
dc.parallel-comp
integer-programming
asked Jul 9, 2011 at 19:12
cstheory.stackexchange.com
5
votes
Sparser Bipartite graphs?
reference-request
graph-theory
planar-graphs
graph-minor
bipartite-graphs
asked May 19, 2015 at 17:40
cstheory.stackexchange.com
Top Answers
24
Problems with big open complexity gaps
cstheory.stackexchange.com
13
Can addition be carried out in less than depth 5?
cstheory.stackexchange.com
13
How to prove that USTCONN requires logarithmic space?
cstheory.stackexchange.com
12
Complexity of matrix powering
cstheory.stackexchange.com
10
Efficient logspace algorithms
cstheory.stackexchange.com
7
complexity of greatest common divisor (gcd)
cstheory.stackexchange.com
6
Intermediate problems between L and NL
cstheory.stackexchange.com
5
Reference for Dyck languages being $\mathsf{TC}_0$-complete
cstheory.stackexchange.com
Stack Exchange works best with JavaScript enabled