Login / Signup
Complexity of cover-preserving embeddings of bipartite orders into Boolean lattices.
Grzegorz Herman
Published in:
Reports Math. Log. (2014)
Keyphrases
</>
real valued
vector space
bipartite graph
real time
machine learning
computational complexity
computational cost
boolean functions
complexity analysis
neural network
decision trees
semi supervised
decision problems
memory requirements
euclidean space