A Surface-based DNA Algorithm for the Conversion of Conjunctive Normal Form into Disjunctive Normal Form
Dai Xi-bin
Abstract
Dai Xi-bin
Abstract
Since the computational complexity in converting conjunctive normal form into disjunctive normal form is exponentially graded,therefore,in order to simplify the computational complexity,a surface-based DNA algorithm for the conversion of normal form transforming into disjunctive normal form is put forth.Because DNA base pairing can take place simultaneously,the surface-based DNA algorithm is capable of parallel computation,which makes it possible to lower the computational complexity of converting conjunctive normal form into disjunctive normal form to that of a polynomial operation.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Since the computational complexity in converting conjunctive normal form into disjunctive normal form is exponentially graded,therefore,in order to simplify the computational complexity,a surface-based DNA algorithm for the conversion of normal form transforming into disjunctive normal form is put forth.Because DNA base pairing can take place simultaneously,the surface-based DNA algorithm is capable of parallel computation,which makes it possible to lower the computational complexity of converting conjunctive normal form into disjunctive normal form to that of a polynomial operation.
Key concepts: Disjunctive normal form, Conjunctive normal form, Computational complexity theory, Computation, Algorithm, Mathematics, Polynomial, Order (exchange)