scientific article; zbMATH DE number 7204281

DOI10.4230/LIPIcs.CCC.2017.30zbMath1440.68101arXiv1710.08602MaRDI QIDQ5111161

Aleksandrs Belovs, Siyi Yang, Miklos Santha, Youming Qiao, Gábor Ivanyos

Publication date: 26 May 2020

Full work available at URL: https://arxiv.org/abs/1710.08602

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

zbMATH Keywords

arithmetic circuitcombinatorial NullstellensatzChevalley-Warning theorempolynomial parity argument

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Extremal combinatorics (05D99) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25) Solving polynomial systems; resultants (13P15) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (6)

Understanding PPA-completeness ⋮ Unnamed Item ⋮ On irreduceability of Boolean functions with respect to commutative associative operation ⋮ Adventures in monotone complexity and TFNP ⋮ The complexity of finding fair independent sets in cycles ⋮ The Complexity of Necklace Splitting, Consensus-Halving, and Discrete Ham Sandwich

This page was built for publication: