Skip to main navigation Skip to search Skip to main content

Equivalence classes of random Boolean trees and application to the Catalan satisfiability problem.

Research output: Chapter or section in a book/report/conference proceedingChapter in a published conference proceeding

1   Link opens in a new tab Citation (SciVal)
Original languageEnglish
Title of host publication11th Latin American Theoretical INformatics Symposium (LATIN)
Publication statusPublished - 2014

Cite this