Arithmetic Expression Construction.

DOI10.4230/lipics.isaac.2020.12arXiv2011.11767OpenAlexW3114936134MaRDI QIDQ6065408

Unnamed Author, Jayson Lynch, Erik D. Demaine, Unnamed Author, Lior Hirschfeld, Unnamed Author, Sarah Scheffler, Unnamed Author, Sualeh Asif, Unnamed Author, Unnamed Author, Unnamed Author, Jeffrey Bosboom

Publication date: 14 November 2023

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

zbMATH Keywords

algebraic complexityhardnessexpression trees

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation
• Circuit minimization problem
• The Complexity of Boolean Formula Minimization
• Computing Sequences with Addition Chains
• A Survey of Fast Exponentiation Methods
• Dichotomy for Pure Scoring Rules Under Manipulative Electoral Actions
• Computational Complexity
• Cryptography and Coding
• Breaking RSA Generically Is Equivalent to Factoring

This page was built for publication: Arithmetic Expression Construction.