Independence number and the complexity of families of sets
From MaRDI portal
(Redirected from Publication:1918552)
Recommendations
- Some results on the complexity of families of sets
- A generalization of the independence number
- On the number of independent sets in expanders
- Independent families and some notions of finiteness
- On the number of independent sets in simple hypergraphs
- On the complexity of approximating the independent set problem
- Counting and enumerating independent sets with applications to combinatorial optimization problems
- The number of independent sets in graphs
- Counting independent sets in cocomparability graphs
- Parameterized extension complexity of independent set and related problems
Cites work
- scientific article; zbMATH DE number 53984 (Why is no real title available?)
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A Note on Venn Diagrams
- A theorem on independence
- Asymptotics via empirical processes. With comments and a rejoinder by the author
- Empirical processes
- Inclusion-exclusion-Bonferroni identities and inequalities for discrete tube-like problems via Euler characteristics
- Independence number and the complexity of families of sets
- Independent collections of translates of boxes and a conjecture due to Grünbaum
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- On the density of families of sets
- Probability Inequalities for Sums of Bounded Random Variables
- Sur l'indépendance de domaines simples dans l'espace euclidien à n dimensions
- Venn Diagrams and Independent Families of Sets
- -nets and simplex range queries
Cited in
(4)
This page was built for publication: Independence number and the complexity of families of sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1918552)
