Login / Signup

The Complexity of Near-Optimal Programmable Logic Array Folding.

S. S. RaviErrol L. Lloyd
Published in: SIAM J. Comput. (1988)
Keyphrases
  • search algorithm
  • computational complexity
  • worst case
  • lower complexity
  • databases
  • data mining
  • knowledge base
  • decision trees
  • high level
  • database systems
  • reinforcement learning
  • objective function
  • memory requirements