Cite
Complexity assessments for decidable fragments of Set Theory. IV: A quadratic reduction of constraints over nested sets to Boolean formulae
MLA
Cantone, Domenico, et al. Complexity Assessments for Decidable Fragments of Set Theory. IV: A Quadratic Reduction of Constraints over Nested Sets to Boolean Formulae. Dec. 2021. EBSCOhost, widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsair&AN=edsair.doi.dedup.....9a1c1e1a623f63ffc53eecb1a2022b81&authtype=sso&custid=ns315887.
APA
Cantone, D., De Domenico, A., Maugeri, P., & Omodeo, E. G. (2021). Complexity assessments for decidable fragments of Set Theory. IV: A quadratic reduction of constraints over nested sets to Boolean formulae.
Chicago
Cantone, Domenico, Andrea De Domenico, Pietro Maugeri, and Eugenio G. Omodeo. 2021. “Complexity Assessments for Decidable Fragments of Set Theory. IV: A Quadratic Reduction of Constraints over Nested Sets to Boolean Formulae,” December. http://widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edsair&AN=edsair.doi.dedup.....9a1c1e1a623f63ffc53eecb1a2022b81&authtype=sso&custid=ns315887.