Login / Signup

P-Optimal Proof Systems for Each NP-Set but no Complete Disjoint NP-Pairs Relative to an Oracle.

Titus Dose
Published in: MFCS (2019)
Keyphrases
  • pairwise
  • np hard
  • database
  • dynamic programming
  • management system
  • np complete
  • information systems
  • upper bound
  • worst case
  • complex systems
  • minimum cost
  • truth table