On the algebraic complexity of set equality and inclusion

DOI10.1016/j.ipl.2004.07.006zbMath1173.68823OpenAlexW2023338316MaRDI QIDQ834932

Irit Katriel

Publication date: 27 August 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.07.006

zbMATH Keywords

computational complexitycomputational modelsset equalityalgebraic computation tree

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Cites Work

• Lower Bounds for Algebraic Computation Trees of Functions with Finite Domains
• Unnamed Item

This page was built for publication: On the algebraic complexity of set equality and inclusion