Skip to main content

New answers tagged

-1 votes

Time complexity to convert a truth table to a boolean circuit

It should be polynomial for k-SAT with k not equal to 2. Otherwise it would exist a polynomial reduction from 2-SAT(that is in P) to an np-complete and than P=NP.
user3682770's user avatar
0 votes

Efficient data structure for multidimensional lookup

IF the set of GOOD tuples is fixed and you only need to know if the new point would be classified as GOOD or BAD, then you could train a binary classifier(like a decision tree) to reach the binary ...
Sachith Pai's user avatar

Top 50 recent answers are included