Arithmetic expression construction
When can n given numbers be combined using arithmetic operators from a given subset of {+,−,×,÷} to obtain a given target number? We study three variations of this problem of Arithmetic Expression Construction: when the expression (1) is unconstrained; (2) has a specified pattern of parentheses and...
Main Authors: | Alcock, L (Author), Bosboom, J (Author), Chen, C (Author), Epstein, R (Author), Hirschfeld, L (Author), Lynch, J (Author), Zhang, L (Author), Asif, S (Author), Brunner, J (Author), Demaine, ED (Author), Hesterberg, A (Author), Hu, W (Author), Scheffler, S (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
2022-07-22T14:19:40Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Mario Kart Is Hard
by: Waingarten, Erik, et al.
Published: (2017) -
Even 1 × n Edge-Matching and Jigsaw Puzzles are Really Hard
by: Bosboom, Jeffrey William, et al.
Published: (2019) -
Tetris is NP-hard even with O (1) Rows or Columns
by: Asif, Sualeh, et al.
Published: (2022) -
Arithmetic for Printers
by: Auble, J. W.
Published: (1935) -
Recursed is not recursive: A jarring result
by: Demaine, ED, et al.
Published: (2022)