Login / Signup

Truth-table Closure and Turing Closure of Average Polynomial Time have Different Measures in EXP.

Rainer Schuler
Published in: Computational Complexity Conference (1996)
Keyphrases
  • truth table
  • dnf formulas
  • special case
  • boolean functions
  • defeasible logic
  • computational complexity
  • approximation algorithms
  • membership queries
  • term dnf
  • log log