Revision as of 06:43, 19 August 2007 edit Trovatore (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 39,116 edits "The general problem is NP"		Revision as of 07:30, 19 August 2007 edit undo Dfass (talk \| contribs) Extended confirmed users 9,013 edits m →"The general problem is NP" Next edit →
Line 6: Probably what is intended here is that the problem is ''NP-hard'', or perhaps ''NP-complete'' (which means both NP-hard and NP). Another slim possibility is that it means something like "the problem is NP, and if the polynomial-time heirarchy does not collapse, then the problem is not P". I don't know enough about the problem to say which of these is the intended meaning. Someone who does, please clarify. --[[User:Trovatore\|Trovatore]] 06:43, 19 August 2007 (UTC) : Apologies. It's not my field, and I just wrote it off the top of my head (from some dim memory). I changed it now to something possibly better, although I'm hoping that someone who knows the field will swoop in and make it into a real article. —[[User:Dfass\|Dfass]] 07:30, 19 August 2007 (UTC)

Talk:Circuit minimization for Boolean functions: Difference between revisions