The number of Boolean functions computed by formulas of a given size
From MaRDI portal
Publication:4705331
DOI<349::AID-RSA9>3.0.CO;2-V 10.1002/(SICI)1098-2418(199810/12)13:3/4<349::AID-RSA9>3.0.CO;2-VzbMath0959.68525OpenAlexW1995952087MaRDI QIDQ4705331
Publication date: 19 December 1999
Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199810/12)13:3/4<349::aid-rsa9>3.0.co;2-v
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Formulas versus Circuits for Small Distance Connectivity ⋮ On lengths of edge-labeled graph expressions ⋮ Using relevance queries for identification of read-once functions ⋮ Enumerating lambda terms by weighted length of their de Bruijn representation ⋮ Almost-natural proofs ⋮ Decomposition methods for generating algebraic expressions of full square rhomboids and other graphs
This page was built for publication: The number of Boolean functions computed by formulas of a given size
