Login / Signup

Complexity of hierarchically and 1-dimensional periodically specified problems I: Hardness results.

Madhav V. MaratheHarry B. Hunt IIIRichard Edwin StearnsVenkatesh Radhakrishnan
Published in: Satisfiability Problem: Theory and Applications (1996)
Keyphrases
  • np hardness
  • worst case
  • np complete
  • decision problems
  • computational complexity
  • problems involving
  • databases
  • real world
  • multi dimensional
  • phase transition
  • complexity analysis