General Mathematics

    

Computational Complexity Analysis using Negation Negation Normal Form Circuit

Authors: Koji KOBAYASHI

概要. This paper describes about analyzing method for computational complexity using Negation Normal Form Circuit. Although Negation Normal Form Circuit can emulate Turing machines, most of the circuits are monotonic. In this paper, Negation Normal Form Circuit is further divided into a monotonic subcircuit consisting of AND and OR gate (Rating Circuit) and a subcircuit consisting of NOT elements, and the analysis focuses on the Rating Circuit. From the viewpoint of the Rating Circuit, the NOT gate is constraint on the input of the Rating Circuit. We can use another input constraints. By changing the constraints of the inputs of Rating Circuit, We can analyse complexity detail. In this paper, we use this method to analyze the complexity of the clique problem.

Comments: 17 Pages.

Download: PDF

Submission history

[v1] 2024-10-09 21:13:36

Unique-IP document downloads: 170 times

Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus