Peter

91

Reputation

62 views

Unregistered User

Name	Peter
Member for	3 years
Seen	Jan 22 at 14:44
Website
Location
Age

stats recent reputation favorites

0

Questions

4

Answers

votes newest views recent

Large Intersecting Subsets of a Set

Non-constructive proofs vs. efficient algorithms

The probability for a sequence to have small partial sums

Example of: K-regular graph with girth K, for a given K

0

Votes

8

Tags

co.combinatorics× 3
proof-theory
pr.probability
polymath5
math-philosophy
lo.logic
graph-theory
computational-complexity

2

Badges