We study the problem of anonymizing tables containing personal information before releasing them for public use. One of the formulations considered in this context is the k-anonymization problem: given a table, suppress a minimum number of cells so that in the transformed table, each row is identical to atleast k − 1 other rows. The problem is known to be NP-hard and MAXSNP-hard; but in the kno...

OBJECTIVE In the past decade, much has been written about 'the hard problem' of consciousness in the philosophy of mind. However, a separate hard problem faces the scientific study of consciousness. The problem arises when distinguishing the neural correlates of consciousness (NCC) and the neural constitution of consciousness. Here, I explain this correlation/constitution distinction and the pr...

A complete solution of the Kepler problem is given; the SO(4) action on (TS,Ω4) is discussed; and the incomplete Kepler hamiltonian vector field is regularized by the LS map, embedding it into (TS, ω̃4). [2] did excellent work on these topics. I read through them and write this report. O Introduction Kepler problem is a famous and classical problem in both mathematics and physics. Since Kepler, ...

We introduce and study the properties of Boolean autoencoder circuits. In particular, we show that the Boolean autoencoder circuit problem is equivalent to a clustering problem on the hypercube. We show that clustering m binary vectors on the n-dimensional hypercube into k clusters is NP-hard, as soon as the number of clusters scales like m (ε > 0), and thus the general Boolean autoencoder prob...