Theoretical Computer Science
Marcus Ritt
  • Member for 11 years, 2 months
  • Last seen more than a month ago
  • Porto Alegre, Brazil
Profile Activity
Stats
1,440
reputation
49k
reached
21
answers
2
questions
Communities
View all
About

Air of mystery.

Badges
View all badges
This user doesn’t have any gold badges yet.
14
silver badges
21
bronze badges
Top tags
View all tags
43
Score
6
Posts
26
Posts %
34
Score
6
Posts
26
Posts %
33
Score
8
Posts
35
Posts %
31
Score
5
Posts
22
Posts %
18
Score
7
Posts
30
Posts %
14
Score
3
Posts
13
Posts %
Top posts
View all questions and answers
All Questions Answers
Votes Newest
17
How hard is counting the number of vertex covers after a small perturbation?
Apr 14 '11
16
Finding the largest set of points of limited diameter
Dec 3 '10
15
NEXP-complete problems
Nov 25 '10
10
Finding a matching whose contraction minimizes the number of arcs in a graph
Jul 31 '11
10
Finding cliques in a big graph
May 2 '11
7
Models of random graphs, for real computer networks
Apr 28 '11
7
Funny TCS-related papers etc?
Nov 21 '10
7
Exercises of polynomial and turing reductions
Feb 11 '11
6
P with integer factorization oracle
Feb 7 '11
6
Feynman and the logarithm
Dec 2 '10
Top network posts
View all network posts
47
Optimization Problem Libraries
18
Family of hard instances for Gomory's cutting plane algorithm
18
Simplex-Implementations in professional Solvers
13
Small Traveling Salesman Problem instance
13
Prove that these linear programming problems are bounded by $O(k^{1/2})$

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.