scientific article; zbMATH DE number 5242388

zbMath1201.68059MaRDI QIDQ5445419

A. A. Voronenko

Publication date: 5 March 2008

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Many-valued logic (03B50)

Related Items (3)

The circuit complexity of checking polynomiality for functions over residue ring modulo a composite number is linear ⋮ Lower bound on the complexity of finding polynomials of Boolean functions in the class of circuits with separated variables ⋮ Monotonicity checking

This page was built for publication: