Theoretical Computer Science
Yaroslav Bulatov
  • Member for 11 years, 3 months
  • Last seen this week
Profile Activity
Stats
4,571
reputation
70k
reached
18
answers
28
questions
Communities
View all
About

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

Badges
View all badges
1
gold badge
22
silver badges
35
bronze badges
Top tags
View all tags
117
Score
25
Posts
54
Posts %
78
Score
9
Posts
20
Posts %
74
Score
8
Posts
17
Posts %
44
Score
19
Posts
41
Posts %
25
Score
8
Posts
17
Posts %
17
Score
7
Posts
15
Posts %
Top posts
View all questions, answers, and articles
All Questions Answers Articles
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
Top network posts
View all network posts
1222
Correct way to write line to file?
199
In Tensorflow, get the names of all the Tensors in a graph
171
Tensorflow set CUDA_VISIBLE_DEVICES within jupyter
140
SVM - hard or soft margins?
106
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.