Theoretical Computer Science
Yaroslav Bulatov
Profile Activity
Stats
4,499
reputation
69k
reached
18
answers
27
questions
About

Google (OCR team) -> Google Brain -> OpenAI -> PyTorch team (Facebook)

Communities (27)

Top network posts

1
gold badge
22
silver badges
35
bronze badges
View all badges

Top tags (50)

Score 117
Posts 25
Posts % 56
Score 78
Posts 9
Score 74
Posts 8
Score 44
Posts 18
Score 25
Posts 8
Score 17
Posts 6
View all tags →

Top posts (45)

All Questions Answers
Votes Newest
67 The origin of the notion of treewidth Feb 20 '11
35 Powerful Algorithms too complex to implement Jan 23 '11
31 what is easy for minor-excluded graphs? Oct 22 '10
28 Which SAT problems are easy? Jan 18 '11
27 When is relaxed counting hard? Sep 22 '10
23 graphs from real-life problems Nov 30 '10
21 Examples of hardness phase transitions Nov 3 '10
15 Graph decompositions for combining "local" functions of vertex labelings Oct 31 '10
13 LP relaxation of independent set Feb 26 '11
12 Typical hardness of tree decomposition? Dec 8 '10
View all questions and answers →

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.