Theoretical Computer Science
Mikola
  • Member for 11 years, 3 months
  • Last seen more than a month ago
Profile Activity
Stats
571
reputation
31k
reached
2
answers
5
questions
Communities
View all
Badges
View all badges
1
gold badge
3
silver badges
10
bronze badges
Top tags
View all tags
2
Score
1
Posts
14
Posts %
2
Score
1
Posts
14
Posts %
0
Score
4
Posts
57
Posts %
0
Score
1
Posts
14
Posts %
0
Score
1
Posts
14
Posts %
0
Score
1
Posts
14
Posts %
Top posts
All Questions Answers Articles
Votes Newest
21
Direct SAT to 3-SAT reduction
Jul 3 '11
7
Size of BSP tree for a simple polygon?
Mar 29 '11
6
Finding balls that contain a point
May 8 '14
4
Bichromatic all nearest neighbors
Nov 18 '14
4
Algorithm to find all intersections in set of simplices
Nov 23 '14
2
Partitioning a set of 2d polygons into intersection-connected subsets
Jan 15 '14
0
Determining connectivity for a fully dynamic graph with vertex/subgraph insertion and deletion
Dec 20 '13
Top network posts
View all network posts
80
In OpenGL ES 2.0 / GLSL, where do you need precision specifiers?
73
Why aren't representations of monoids studied so much?
48
Basic Dual Contouring Theory
44
Category theoretic interpretation of matroids?
43
How to kill a child process by the parent process?

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.