The Influence of Linear-Time Models on Complexity Theory
Vimala D1, I. Mary Linda2, Kavitha G3
1Vimala D, Department of Computer Science and Engineering, Bharath Institute of Higher Education and Research, Chennai (Tamil Nadu), India.
2I. Mary Linda, Department of Computer Science and Engineering, Bharath Institute of Higher Education and Research, Chennai (Tamil Nadu), India.
3Kavitha G, Department of Computer Science and Engineering, Bharath Institute of Higher Education and Research, Chennai (Tamil Nadu), India.
Manuscript received on 13 August 2019 | Revised Manuscript received on 04 September 2019 | Manuscript Published on 17 September 2019 | PP: 208-211 | Volume-8 Issue-2S8 August 2019 | Retrieval Number: B13500882S819/2019©BEIESP | DOI: 10.35940/ijrte.B1350.0882S819
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Various scientists would agree that, had it not been for uncommon programming, the cognizance of model checking may never have occurred. Notwithstanding the way that it might give off an impression of being nonsensical, it is maintained by existing work in the field. In our assessment, we nullify the association of checksums. We present new reproduced models, which we call Prie. [1],[ 3],[5].
Keywords: Architecture, Hardware, Gates.
Scope of the Article: Database Theory and Application