Genus g graphs have pagenumber O( square root g)

  • Authors:

  • S. M. Malitz

  • Affiliations:

  • Dept. of Math., MIT, Cambridge, MA, USA

  • Venue:
  • SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
  • Year:
  • 1988

Quantified Score

Hi-index 0.00

Visualization

Abstract

A simple construction for a pseudorandom bit generator is presented. It stretches a short string of truly random bits into a long string that looks random to any algorithm from a complexity class C (e.g. P, NC, PSPACE, etc.), using an arbitrary function ...