scientific article; zbMATH DE number 5485585

zbMath1231.68143MaRDI QIDQ5302096

Ran Raz

Publication date: 5 January 2009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (11)

Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits ⋮ A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle ⋮ Lower bounds for the circuit size of partially homogeneous polynomials ⋮ On the closures of monotone algebraic classes and variants of the determinant ⋮ Maliciously circuit-private multi-key FHE and MPC based on LWE ⋮ Complexity classes and completeness in algebraic geometry ⋮ Circuit-Private Multi-key FHE ⋮ Monotone separations for constant degree polynomials ⋮ Non-commutative circuits and the sum-of-squares problem ⋮ Unnamed Item ⋮ Variants of the determinant polynomial and the \textsf{VP}-completeness

This page was built for publication: