Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 3 of 3 for “"Polynomial Identity Testing"”.

  1. Polynomial identity testing of read-once oblivious algebraic branching programs

    … of obtaining efficient, deterministic, black-box polynomial identity testing algorithms (PIT) for algebraic branching programs (ABPs) that are read-once and oblivious. This class has an efficient, deterministic, white-box polynomial identity testing algorithm (due to Raz and Shpilka [RS05]), but …

    mit Repository record for Polynomial identity testing of read-once oblivious algebraic branching programs (opens in a new tab)

  2. Algebraic dependence testing in the perspective of algebraic matroids

    … problem called algebraic dependence testing, where we seek to find a polynomial relation among a set of polynomials. This notion generalizes linear dependence, and understanding it has had applications to deterministic polynomial identity testing and algebraic circuit lower bounds. We …

    uiuc Repository record for Algebraic dependence testing in the perspective of algebraic matroids (opens in a new tab)

  3. Polynomial ideals in algebraic complexity

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2023-12-04 without embargo terms

    uiuc Repository record for Polynomial ideals in algebraic complexity (opens in a new tab)