Lower Bound on Average-Case Complexity of Inversion of Goldreich’s Function by Drunken Backtracking Algorithms (Q3569744)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Lower Bound on Average-Case Complexity of Inversion of Goldreich’s Function by Drunken Backtracking Algorithms
scientific article

    Statements

    Lower Bound on Average-Case Complexity of Inversion of Goldreich’s Function by Drunken Backtracking Algorithms (English)
    0 references
    0 references
    22 June 2010
    0 references

    Identifiers