Basket

    1.
    0404725 - UIVT-O 20020127 DE eng A - Abstract
    Žák, Stanislav
    Information Flow in Read-Once Branching Programs.
    Complexity of Boolean Functions. Dagstuhl, 2002 - (Barrington, D.; Hastad, J.; Krause, M.; Reischuk, R.). s. 11
    [Seminar. 17.03.2002-22.03.2002, Dagstuhl]
    Institutional research plan: AV0Z1030915
    Keywords : read-once branching programs * lower bound * information flow
    Subject RIV: BA - General Mathematics
    Permanent Link: http://hdl.handle.net/11104/0124963
     
     
  2. 2.def.record 'I2_TF_SHORT' not found in 'CavUnTablesd'

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.

Accept allSettingsReject all