Abstract
In this paper we show how Networks of Polarized Splicing Processors (NPSPs) can be used as problem solvers. We give a detailed uniform solution for the 3-coloring problem using O(m*n) time and we briefly discuss a solution for the 3-SAT problem in O(n*m) time. We also give the complete algorithm that can solve the n-queens completion problem in O(n*(n−m)) time, hence the n-queens problem in O(n2) time. All of the solutions use NPSPs with 2 nodes.
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.
