And/Or Trees Revisited

DOI10.1017/S0963548304006273MaRDI QIDQ4670353zbMATH OpenFDO

Authors Brigitte Chauvin, Danièle Gardy, Bernhard Gittenberger, Philippe Flajolet

Publication date 18 April 2005

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548304006273

Mathematics Subject Classification ID

Boolean functions (06E30) Combinatorial probability (60C05)

Recommendations

• Tree indiscernibilities, revisited
• Theory of finite or infinite trees revisited
• Tree drawings revisited
• Tree drawings revisited
• Recurrent and transient trees
• On a poset of trees revisited
• And/or trees: A local limit point of view
• scientific article; zbMATH DE number 951849
• scientific article; zbMATH DE number 1186101

Cited in

(31)

• Enumerating lambda terms by weighted length of their de Bruijn representation
• TBA and tree expansion
• Independent distributions on a multi-branching AND-OR tree of height 2
• Associative and commutative tree representations for Boolean functions
• Recurrent and transient trees
• No Shannon effect induced by and/or trees
• Fragmentation Trees Reloaded
• The fraction of large random trees representing a given Boolean function in implicational logic
• Asymptotic properties of combinatory logic
• Retractions to Pseudoforests
• The distribution of height and diameter in random non-plane binary trees
• A sprouting tree model for random boolean functions
• Intuitionistic vs. Classical Tautologies, Quantitative Comparison
• Some typical properties of large AND/OR Boolean formulas
• Complexity and Limiting Ratio of Boolean Functions over Implication
• Quantitative Comparison of Intuitionistic and Classical Logics - Full Propositional System
• In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid
• Some typical properties of large AND/OR Boolean formulas
• Renorming James tree space
• scientific article; zbMATH DE number 1444007 (Why is no real title available?)
• Balanced and/or trees and linear threshold functions
• The growing tree distribution on Boolean functions.
• Exploring the average values of Boolean functions via asymptotics and experimentation
• The relation between tree size complexity and probability for Boolean functions generated by uniform random trees
• Equivalence classes of random Boolean trees and application to the Catalan satisfiability problem
• And/or tree probabilities of Boolean functions
• Kazuyuki Tanaka's Work on AND-OR Trees and Subsequent Developments
• Fuzzy logics – quantitatively
• 2-Xor revisited: satisfiability and probabilities of functions
• Generalised and quotient models for random and/or~trees and application to satisfiability
• Finite-depth scaling and an exact Bernoulli-leaf identity for the min-plus process on the binary tree

This page was built for publication: And/Or Trees Revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4670353)