Theoretical Computer Science
Stasys
  • Member for 10 years, 6 months
  • Last seen more than 2 years ago
Profile Activity
Stats
6,555
reputation
174
reached
1
answer
0
questions
Communities
About

All information is on my homepage.

Badges
View all badges
This user doesn’t have any gold badges yet.
10
silver badges
3
bronze badges
Top tags
3
Score
1
Posts
100
Posts %
3
Score
1
Posts
100
Posts %
Top posts
All Questions Answers
Votes Newest
3
About my currently active bounty
Nov 14 '11
Top network posts
View all network posts
47
Monotone complexity of s-t connectivity
33
Is BPP= P known for ANY uniform model of computation?
32
Combinatorics of Bellman-Ford or how to make cyclic graphs acyclic?
27
Is there a better than linear lower bound for factoring and discrete log?
25
Why is HAMILTONIAN CYCLE so different from PERMANENT?

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.