• Title of article

    On the Nonapproximability of Boolean Functions by OBDDs and Read-k-Times Branching Programs

  • Author/Authors

    Beate Bollig، نويسنده , , Martin Sauerhoff، نويسنده , , Ingo Wegener، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2002
  • Pages
    16
  • From page
    263
  • To page
    278
  • Keywords
    computational complexity , branching programs , binary decision diagrams , approximations , lower bounds.
  • Journal title
    Information and Computation
  • Serial Year
    2002
  • Journal title
    Information and Computation
  • Record number

    262088

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=262088