Abstract
A fast computer algorithm is described which brings computation of the permanents of sparse matrices, specifically, chemical adjacency matrices, within the reach of a desktop computer. Examples and results are presented, along with a discussion of the relationship of the permanent to the Kekule structure count. Also presented is a C-language implementation which was deliberately written for ease of translation into other high-level languages.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
