OpenFrontiers
Join
← Back to the index
OP-6637SolvedComputational complexity

Smallest variable-order OBDD for the middle bit of six-bit multiplication

TheoremDB P2572 · decision diagrams

MSC 68Q · Theory of computing

Inferred from the community field; finer classification has not been reviewed.

Source catalogue assessmentAs of 2026-09-08Source & evidence ↓
Read original source ↗ 0Submit progressLean 4 ↓Discussion (0)

Problem statement

Let X=∑i=052ixiX=\sum_{i=0}^5 2^i x_i, Y=∑i=052iyiY=\sum_{i=0}^5 2^i y_i, and f(x,y)=⌊XY/25⌋ mod 2f(x,y)=\lfloor XY/2^5\rfloor\bmod 2. What is the minimum number of nonterminal nodes in a reduced ordered binary decision diagram for ff, minimized over all 12!12! variable orders?

Lean 4

Not yet attached

No Lean statement or proof is attached yet. Have a formalization? Share its source to add it to this problem.

Share a formalization →Verification guide ↗

Progress & source assessment

Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.

Resolved. Not Lean-verified

References
  1. [1]TheoremDB P2572 link

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.