Login / Signup

Efficient Satisfiability Verification for Conditional Importance Networks.

Zachary J. Oster
Published in: ADT (2017)
Keyphrases
  • np complete
  • computationally expensive
  • network design
  • satisfiability testing
  • social networks
  • lower bound
  • model checking
  • complex networks
  • computer networks