Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: More than a quarter of a century ago, the question of the complexity of determining whether a given Boolean formula is minimal motivated Meyer and Stockmeyer to define the polynomial hierarchy. This problem (in the standard formalized version---that of Garey and Johnson) has been known for decades to be coNP-hard and in NPNP, and yet no one had even been able to establish (many-one) NP-hardness. ,  show that and more: The problem in fact is (many-one) hard for parallel access to NP.
['Edith Hemaspaandra', 'Gerd Wechsung']
I am writing a research paper on a idea The Minimization Problem for Boolean Formulas
[{"from": "human", "value": "I am writing a research paper on a idea The Minimization Problem for Boolean Formulas"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: More than a quarter of a century ago, the question of the complexity of determining whether a given Boolean formula is minimal motivated Meyer and Stockmeyer to define the polynomial hierarchy. This problem (in the standard formalized version---that of Garey and Johnson) has been known for decades to be coNP-hard and in NPNP, and yet no one had even been able to establish (many-one) NP-hardness. ,  show that and more: The problem in fact is (many-one) hard for parallel access to NP."}]