Network profile

Akash Kumar

Reputation

1,883

1.9k
1.8k
1.7k

2017
2018
2019
2020

Top tag

reference-request

Next privilege

2,000 Rep.

Edit questions and answers

Badges

Newest

Yearling

Next badge

0/1

Impact

0 posts edited

0 helpful flags

210 votes cast

15 Bookmarks

Votes Activity Newest Views Added

248

votes

answers

96k

views

What is the enlightenment I'm supposed to attain after studying finite automata?

Jan 14 '16 at 11:00 Aryeh 8,168

105

votes

answers

views

Solid applications of category theory in TCS?

pl.programming-languages lo.logic ct.category-theory

May 8 '19 at 9:06 Community♦ 1

votes

answers

views

Techniques for Reversing the Order of Quantiﬁers

lo.logic big-picture proof-techniques

Jan 24 '11 at 12:25 Community♦ 1

votes

answers

views

The origin of the notion of treewidth

graph-theory co.combinatorics big-picture ho.history-overview treewidth

Jan 10 '19 at 9:44 Glorfindel 197

votes

answers

views

Why does Fourier analysis of Boolean functions “work”?

soft-question boolean-functions fourier-analysis

Oct 22 '15 at 13:42 Darrell Whitley 61

votes

answers

views

Why are mod_m gates interesting?

cc.complexity-theory circuit-complexity big-picture circuit-families

Nov 5 '11 at 20:32 Dana Moshkovitz 10.7k

votes

answer

491

views

complexity of the half language

fl.formal-languages automata-theory

Nov 24 '12 at 7:21 Community♦ 1

votes

answers

views

Implications of unprovability of $P\neq NP$

cc.complexity-theory np-hardness big-picture proofs p-vs-np

Jan 14 at 11:01 Community♦ 1

votes

answers

views

Efficient logspace algorithms

cc.complexity-theory space-bounded space-time-tradeoff

Jul 19 '11 at 7:02 Neel Krishnaswami 29.8k

votes

answers

views

Number of mincuts of a graph without using Karger's algorithm

ds.algorithms graph-theory co.combinatorics graph-algorithms max-flow-min-cut

Apr 12 '16 at 6:05 Community♦ 1

votes

answers

749

views

Regarding Pfaffian Methods in Counting and Combinatorics

reference-request co.combinatorics counting-complexity

Jan 20 '11 at 19:36 Community♦ 1

votes

answers

686

views

Hardness of Vertex Separators

cc.complexity-theory approximation-hardness

Dec 3 '11 at 3:03 Chandra Chekuri 5,996

votes

answers

230

views

Statistical tests between L and LogCFL

cc.complexity-theory space-bounded

Oct 13 '10 at 4:24 Shiva Kintali 10.4k

votes

answer

232

views

Proving PSD-ness of matrices

matrices

Dec 9 '14 at 5:50 Sasho Nikolov 17.6k

votes

answer

376

views

An intuitive justification - Metric Embedding Based Approximation Algorithms

approximation-algorithms metric-spaces intuition

Jan 25 '12 at 23:52 zotachidil 602

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

15 Bookmarks

What is the enlightenment I'm supposed to attain after studying finite automata?

Solid applications of category theory in TCS?

Techniques for Reversing the Order of Quantiﬁers

The origin of the notion of treewidth

Why does Fourier analysis of Boolean functions “work”?

Why are mod_m gates interesting?

complexity of the half language

Implications of unprovability of $P\neq NP$

Efficient logspace algorithms

Number of mincuts of a graph without using Karger's algorithm

Regarding Pfaffian Methods in Counting and Combinatorics

Hardness of Vertex Separators

Statistical tests between L and LogCFL

Proving PSD-ness of matrices

An intuitive justification - Metric Embedding Based Approximation Algorithms