1,533 reputation
924
bio website pratikdeoghare.github.com
location India
age
visits member for 3 years, 7 months
seen 9 hours ago

Mar
22
awarded  Civic Duty
Mar
1
answered Hard-looking algorithmic problems made easy by theorems
Feb
15
awarded  Nice Answer
Feb
13
answered Hard-looking algorithmic problems made easy by theorems
Feb
12
awarded  Nice Answer
Jan
20
awarded  Constituent
Jan
14
revised Complexity of determining unique elements of each cycle in a permutation
edited title and tags and fixed a typo
Jan
14
suggested suggested edit on Complexity of determining unique elements of each cycle in a permutation
Jan
14
awarded  Caucus
Jan
6
revised Is cubic complexity still the state of the art for LP?
added reference request tag
Jan
6
suggested suggested edit on Is cubic complexity still the state of the art for LP?
Dec
28
comment Can one automate algorithmic analysis?
When I was young and naive I tried to write complexity analyzer using gcov. It gives you number of times each line was executed. :) Good question!
Dec
18
comment Graph partitioning by node deletion
Graph separators where $B = \varepsilon n$?
Dec
7
answered What is this notation style called?
Dec
7
comment What is this notation style called?
See here1 and Backus-Naur form.
Nov
19
revised Network Flow with Non-contiguous Capacities
changed capacity to flow through some arcs
Nov
19
suggested suggested edit on Network Flow with Non-contiguous Capacities
Aug
26
awarded  Yearling
Jul
22
comment Finding Tours through Near-Hamiltonian Paths?
Do you mean you are allowed to visit a vertex twice if necessary? @Kaveh but if the graph is is directed then its not always possible even if its connected.
Jul
18
comment Integer roots of a polynomial
This might help. Note: I just know the words "Grobner basis" and have almost no idea of what they mean. So I am probably wrong. :)