Stack Exchange
  • log in
  • chat
  • meta
  • about

Stack Exchange

  • All Sites
  • Hot Questions
  • Top Users
  • Newsletters
  • Blogs

Alex Golovnev

New York, United States

cims.nyu.edu/~golovnev

top accounts reputation activity favorites subscriptions
Top Questions
30 votes

Approximation algorithms for Metric TSP

cc.complexity-theory graph-algorithms approximation-algorithms tsp exp-time-algorithms asked Dec 2 '11 at 8:15
cstheory.stackexchange.com

15 votes

Solving Superstring Exactly

cc.complexity-theory ds.algorithms graph-theory tsp exp-time-algorithms asked Jan 2 '12 at 10:27
cstheory.stackexchange.com

11 votes

Known upper bounds on the communication complexity of Karchmer-Wigderson games

cc.complexity-theory circuit-complexity communication-complexity upper-bounds asked Dec 14 '11 at 20:35
cstheory.stackexchange.com

10 votes

Subset Numbering

ds.algorithms graph-algorithms it.information-theory nt.number-theory exp-time-algorithms asked Jul 24 '12 at 14:44
cstheory.stackexchange.com


Top Answers
37
Approximation algorithms for Metric TSP
cstheory.stackexchange.com

7
Solving Superstring Exactly
cstheory.stackexchange.com


about blog legal privacy policy contact us feedback always welcome

site design / logo © 2013 stack exchange, inc; user contributions licensed under cc-wiki with attribution required

2013.6.14.625