Structure and randomness in combinatorics

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Additional info

13 pages, no figures. FOCS 2007 tutorial notes. Minor corrections

Type

Scientific paper

Abstract

Combinatorics, like computer science, often has to deal with large objects of unspecified (or unusable) structure. One powerful way to deal with such an arbitrary object is to decompose it into more usable components. In particular, it has proven profitable to decompose such objects into a \emph{structured} component, a \emph{pseudo-random} component, and a \emph{small} component (i.e. an error term); in many cases it is the structured component which then dominates. We illustrate this philosophy in a number of model cases.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Structure and randomness in combinatorics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Structure and randomness in combinatorics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Structure and randomness in combinatorics will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-230082

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.