{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:21:57Z","timestamp":1725790917939},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642544224"},{"type":"electronic","value":"9783642544231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54423-1_41","type":"book-chapter","created":{"date-parts":[[2014,3,25]],"date-time":"2014-03-25T03:02:27Z","timestamp":1395716547000},"page":"466-477","source":"Crossref","is-referenced-by-count":1,"title":["Equivalence Classes of Random Boolean Trees and Application to the Catalan Satisfiability Problem"],"prefix":"10.1007","author":[{"given":"Antoine","family":"Genitrini","sequence":"first","affiliation":[]},{"given":"C\u00e9cile","family":"Mailler","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"41_CR1","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1137\/S0097539703434231","volume":"36","author":"D. Achlioptas","year":"2006","unstructured":"Achlioptas, D., Moore, C.: Random k-SAT: Two moments suffice to cross a sharp threshold. SIAM Journal of Computing\u00a036(3), 740\u2013762 (2006)","journal-title":"SIAM Journal of Computing"},{"issue":"4-5","key":"41_CR2","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1017\/S0963548304006273","volume":"13","author":"B. Chauvin","year":"2004","unstructured":"Chauvin, B., Flajolet, P., Gardy, D., Gittenberger, B.: And\/Or trees revisited. Combinatorics, Probability and Computing\u00a013(4-5), 475\u2013497 (2004)","journal-title":"Combinatorics, Probability and Computing"},{"issue":"1","key":"41_CR3","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/s00453-009-9308-1","volume":"59","author":"H. Daud\u00e9","year":"2011","unstructured":"Daud\u00e9, H., Ravelomanana, V.: Random 2-XORSAT phase transition. Algorithmica\u00a059(1), 48\u201365 (2011)","journal-title":"Algorithmica"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge U.P. (2009)","DOI":"10.1017\/CBO9780511801655"},{"issue":"3","key":"41_CR5","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1002\/rsa.20379","volume":"40","author":"H. Fournier","year":"2012","unstructured":"Fournier, H., Gardy, D., Genitrini, A., Gittenberger, B.: The fraction of large random trees representing a given boolean function in implicational logic. Random Structures and Algorithms\u00a040(3), 317\u2013349 (2012)","journal-title":"Random Structures and Algorithms"},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Gardy, D.: Random Boolean expressions. In: Colloquium on Computational Logic and Applications, vol.\u00a0AF, pp. 1\u201336. DMTCS (2006)","DOI":"10.46298\/dmtcs.3475"},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"Genitrini, A., Gittenberger, B.: No Shannon effect on probability distributions on Boolean functions induced by random expressions. In: 21st Meeting Analysis of Algorithms, pp. 303\u2013316 (2010)","DOI":"10.46298\/dmtcs.2784"},{"issue":"2","key":"41_CR8","doi-asserted-by":"crossref","first-page":"20","DOI":"10.37236\/2402","volume":"19","author":"A. Genitrini","year":"2012","unstructured":"Genitrini, A., Gittenberger, B., Kraus, V., Mailler, C.: Probabilities of Boolean functions given by random implicational formulas. Electronic Journal of Combinatorics 19(2), P37, 20 pages (electronic) (2012)","journal-title":"Electronic Journal of Combinatorics"},{"issue":"7","key":"41_CR9","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.apal.2011.09.011","volume":"163","author":"A. Genitrini","year":"2012","unstructured":"Genitrini, A., Kozik, J.: In the full propositional logic, 5\/8 of classical tautologies are intuitionistically valid. Ann. of Pure and Applied Logic\u00a0163(7), 875\u2013887 (2012)","journal-title":"Ann. of Pure and Applied Logic"},{"key":"41_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-540-68103-8_7","volume-title":"Types for Proofs and Programs","author":"A. Genitrini","year":"2008","unstructured":"Genitrini, A., Kozik, J., Zaionc, M.: Intuitionistic vs. Classical tautologies, quantitative comparison. In: Miculan, M., Scagnetto, I., Honsell, F. (eds.) TYPES 2007. LNCS, vol.\u00a04941, pp. 100\u2013109. Springer, Heidelberg (2008)"},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"Kozik, J.: Subcritical pattern languages for And\/Or trees. In: Fifth Colloquium on Mathematics and Computer Science. DMTCS Proceedings (2008)","DOI":"10.46298\/dmtcs.3582"},{"key":"41_CR12","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1002\/(SICI)1098-2418(199705)10:3<337::AID-RSA4>3.0.CO;2-X","volume":"10","author":"H. Lefmann","year":"1997","unstructured":"Lefmann, H., Savick\u00fd, P.: Some typical properties of large And\/Or Boolean formulas. Random Structures and Algorithms\u00a010, 337\u2013351 (1997)","journal-title":"Random Structures and Algorithms"},{"issue":"4","key":"41_CR13","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/BF00049427","volume":"40","author":"M. Sibuya","year":"1988","unstructured":"Sibuya, M.: Log-concavity of Stirling numbers and unimodality of Stirling distributions. Ann. of the Institute of Statistical Mathematics\u00a040(4), 693\u2013714 (1988)","journal-title":"Ann. of the Institute of Statistical Mathematics"}],"container-title":["Lecture Notes in Computer Science","LATIN 2014: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54423-1_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T22:32:30Z","timestamp":1648679550000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54423-1_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642544224","9783642544231"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54423-1_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}