On the evolution of random boolean functions (1994)
- Authors:
- Autor USP: KOHAYAKAWA, YOSHIHARU - IME
- Unidade: IME
- Assunto: TEORIA DOS GRAFOS
- Language: Inglês
- Imprenta:
- Publisher: János Bolyai Mathematical Society
- Publisher place: Budapest
- Date published: 1994
- Source:
- Título: Proceedings
- Conference titles: Conference Extremal Problems for Finite Sets
-
ABNT
BOLLOBÁS, Béla e KOHAYAKAWA, Yoshiharu e LUCZAK, T. On the evolution of random boolean functions. 1994, Anais.. Budapest: János Bolyai Mathematical Society, 1994. Disponível em: https://www.tib.eu/en/search/id/BLCP%3ACN015367308/On-the-evolution-of-Random-Boolean-Functions/. Acesso em: 04 jan. 2026. -
APA
Bollobás, B., Kohayakawa, Y., & Luczak, T. (1994). On the evolution of random boolean functions. In Proceedings. Budapest: János Bolyai Mathematical Society. Recuperado de https://www.tib.eu/en/search/id/BLCP%3ACN015367308/On-the-evolution-of-Random-Boolean-Functions/ -
NLM
Bollobás B, Kohayakawa Y, Luczak T. On the evolution of random boolean functions [Internet]. Proceedings. 1994 ;[citado 2026 jan. 04 ] Available from: https://www.tib.eu/en/search/id/BLCP%3ACN015367308/On-the-evolution-of-Random-Boolean-Functions/ -
Vancouver
Bollobás B, Kohayakawa Y, Luczak T. On the evolution of random boolean functions [Internet]. Proceedings. 1994 ;[citado 2026 jan. 04 ] Available from: https://www.tib.eu/en/search/id/BLCP%3ACN015367308/On-the-evolution-of-Random-Boolean-Functions/ - A note on induced cycles in kneser graphs
- On K4-free subgraphs of random graphs
- Ramsey games against a one-armed bandit
- Efficient testing of hypergraphs
- Bounds for optimal coverings
- Almost spanning subgraphs of random graphs after adversarial edge removal
- The chromatic thresholds of graphs
- Percolation in high dimensions
- Small subsets inherit sparse ε-regularity
- An improved upper bound on the density of universal random graphs
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
