challenge: What is being summarized in the given text?
  
  A. Classes of decision problems in computational complexity theory
  B. Variants of NP-complete problems
  C. Variants of IP which modify the definition of the interactive proof system
  D. Types of probabilistically checkable proofs
  Answer: 