Equivalence classes of random Boolean trees and application to the Catalan satisfiability problem (Q5405065)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Equivalence classes of random Boolean trees and application to the Catalan satisfiability problem |
scientific article; zbMATH DE number 6276031
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Equivalence classes of random Boolean trees and application to the Catalan satisfiability problem |
scientific article; zbMATH DE number 6276031 |
Statements
Equivalence Classes of Random Boolean Trees and Application to the Catalan Satisfiability Problem (English)
0 references
31 March 2014
0 references
random Boolean expressions
0 references
Boolean formulas
0 references
Boolean function
0 references
probability distribution
0 references
satisfiability
0 references
analytic combinatorics
0 references
0.8856432437896729
0 references
0.8135647177696228
0 references
0.8031610250473022
0 references
0.7945818901062012
0 references
0.7915159463882446
0 references
