VC density and dp rank

Details VC density and dp rank VC density and dp rank

2011-08-22

arxiv.org/abs/1108.4398v3

Mathematics

Logic

Error in Theorem 4.2

Scientific paper

We derive that dpR(n) \leq dens(n) \leq dpR(n)+1, where dens(n) is the
supremum of the VC density of all formulas in n parameters, and dpR(n) is the
maximum depth of an ICT pattern in n variables. Consequently, strong dependence
is equivalent to finite VC density.

Affiliated with

Also associated with

No associations

Rating

VC density and dp rank 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 VC density and dp rank, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and VC density and dp rank will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-176790