Login / Signup

Lower Bounds for Constant Depth Circuits for Prefix Problems.

Ashok K. ChandraSteven FortuneRichard J. Lipton
Published in: ICALP (1983)
Keyphrases
  • lower bound
  • optimization problems
  • randomly generated problems
  • objective function
  • np complete
  • data structure
  • scheduling problem
  • high speed
  • depth map
  • decision problems
  • branch and bound
  • delay insensitive