Last call to make your voice heard! Our 2022 Developer Survey closes in less than a week. Take survey.
Theoretical Computer Science
user avatar
user avatar
user avatar
Yaroslav Bulatov
  • Member for 11 years, 9 months
  • Last seen this week
Profile Activity
Stats
4,631
reputation
71k
reached
18
answers
29
questions
Communities
View all
About

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

Badges
View all badges
1
gold badge
22
silver badges
36
bronze badges
Top tags
View all tags
117
Score
26
Posts
55
Posts %
78
Score
9
Posts
19
Posts %
74
Score
8
Posts
17
Posts %
44
Score
19
Posts
40
Posts %
25
Score
8
Posts
17
Posts %
17
Score
7
Posts
15
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
67
The origin of the notion of treewidth
Feb 20, 2011
answer
36
Powerful Algorithms too complex to implement
Jan 23, 2011
question
31
what is easy for minor-excluded graphs?
Oct 22, 2010
question
28
Which SAT problems are easy?
Jan 18, 2011
question
27
When is relaxed counting hard?
Sep 22, 2010
question
23
graphs from real-life problems
Nov 30, 2010
question
21
Examples of hardness phase transitions
Nov 3, 2010
question
15
Graph decompositions for combining "local" functions of vertex labelings
Oct 31, 2010
question
13
LP relaxation of independent set
Feb 26, 2011
question
12
Typical hardness of tree decomposition?
Dec 8, 2010
Top network posts
View all network posts
1271
Correct way to write line to file?
200
In Tensorflow, get the names of all the Tensors in a graph
181
Tensorflow set CUDA_VISIBLE_DEVICES within jupyter
143
SVM - hard or soft margins?
112
How to get keycodes for xmodmap?

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.