DNA Computation of Integer Addition Table with Applications to Boolean Convolution

    Research output: Contribution to journalArticlepeer-review

    Abstract

    Four specific complexity measures for DNA-based computations are considered: the number of test tubes, the maximal number of molecules in a tube, the maximal length of a molecule, the number of elementary lab operations. These measures are estimated for three DNA procedures for computing the integer addition table. Then, using the addition table, two algorithms for the Boolean convolution are considered and evaluated from the point of view of their complexity.
    Original languageEnglish
    Pages (from-to)319
    Number of pages329
    JournalRomanian Journal of Information Science and Technology
    Volume1
    Issue number4
    Publication statusPublished - 1998

    Subject classification (UKÄ)

    • Computer and Information Science

    Fingerprint

    Dive into the research topics of 'DNA Computation of Integer Addition Table with Applications to Boolean Convolution'. Together they form a unique fingerprint.

    Cite this