A Critique of Kumar's "Necessary and Sufficient Condition for Satisfiability of a Boolean Formula in CNF and Its Implications on P versus NP Problem". Chavrimootoo, M. & Welles, H. Technical Report arXiv:2112.06062 [cs.CC], Computing Research Repository, arXiv.org/corr/, December, 2021.
A Critique of Kumar's "Necessary and Sufficient Condition for Satisfiability of a Boolean Formula in CNF and Its Implications on P versus NP Problem" [link]Link  bibtex   2 downloads  
@techreport{cha-wel:t:kumar-critique,
	author={M. Chavrimootoo and H. Welles},
	title={A Critique of {Kumar}'s "{Necessary} and Sufficient Condition 
	for Satisfiability of a Boolean Formula in {CNF} and Its Implications on 
	{P} versus {NP} Problem"}, 
	year={2021},
	month=dec,
	number={arXiv:2112.06062 [cs.CC]},
	institution={Computing Research Repository, arXiv.org/corr/},
	url_Link = {https://arxiv.org/abs/2112.06062}
}

Downloads: 2