Lower bound arguments with “inaccessible" numbers

  • Authors:
  • Martin Dietzfelbinger;Wolfgang Maass

  • Affiliations:
  • Univ. of Illinois, Chicago;Univ. of Illinois, Chicago

  • Venue:
  • Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
  • Year:
  • 1988

Quantified Score

Hi-index 0.02

Visualization

Abstract