Balanced And/Or trees and linear threshold functions

DOI10.1137/1.9781611972993.8zbMath1430.68165OpenAlexW3115002231MaRDI QIDQ5194664

Daniéle Gardy, Antoine Genitrini, Hervé Fournier

Publication date: 16 September 2019

Published in: 2009 Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/327483e9ac1ed22510d145cd552712adf9c1cee6

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (3)

What is the satisfiability threshold of random balanced Boolean expressions? ⋮ Generalised and quotient models for random and/or~trees and application to satisfiability ⋮ Associative and commutative tree representations for Boolean functions

This page was built for publication: Balanced And/Or trees and linear threshold functions