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, Bosboom, J, Chen, C, Epstein, R, Hirschfeld, L, Lynch, J, Zhang, L, Asif, S, Brunner, J, Demaine, ED, Hesterberg, A, Hu, W, Scheffler, S |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
2022
|
Online Access: | https://hdl.handle.net/1721.1/143959 |
Similar Items
-
Path Puzzles: Discrete Tomography with a Path Constraint is Hard
by: Bosboom, Jeffrey, et al.
Published: (2021) -
Mario Kart Is Hard
by: Waingarten, Erik, et al.
Published: (2017) -
Correct-by-construction finite field arithmetic in Coq
by: Philipoom, Jade (Jade D.)
Published: (2018) -
Tetris is NP-hard even with O (1) Rows or Columns
by: Asif, Sualeh, et al.
Published: (2022) -
Even 1 × n Edge-Matching and Jigsaw Puzzles are Really Hard
by: Bosboom, Jeffrey William, et al.
Published: (2019)