Stochastic Algorithms: Foundations and Applications
From MaRDI portal
Publication:5493349
DOI10.1007/11571155zbMATH Open1159.68656OpenAlexW4300662474MaRDI QIDQ5493349FDOQ5493349
Authors: Alexander Sapozhenko
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11571155
Recommendations
Cited In (12)
- Applications of graph containers in the Boolean lattice
- On computing boundary functional sums
- The method of hypergraph containers
- Independent sets in algebraic hypergraphs
- Hypergraph containers
- List colorings of multipartite hypergraphs
- Independent sets in graphs
- Online containers for hypergraphs, with applications to linear equations
- Lower bounds for piercing and coloring boxes
- On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion
- On the number of error correcting codes
- Simple containers for simple hypergraphs
This page was built for publication: Stochastic Algorithms: Foundations and Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5493349)