Read the equation
A partition and its complement represent the same bipartition. Pinning one of n nodes to the first side leaves m=n−1 freely encoded binary choices. One of the 2ᵐ assignments puts every node on the same side and is invalid, leaving 2ⁿ⁻¹−1 valid cuts.
Terms & definitions
| Term | Meaning in this source |
|---|---|
| m | Number of partition-encoding bits or simulated qubits |
| n | Number of network nodes |
How it works
Read the definition from its right-hand expression to the quantity on the left. Its surrounding source records the intended input, state, or parameter context. Where the source leaves an operation unspecified, this page preserves that gap.
Assumptions & limits
Source recovery establishes that the expression appears in this record. Its mathematical validity, implementation behavior, and interpretation must be assessed separately. See the linked source and research notes for the checks available for this version.
Original context
Read the surrounding source passage
\subsection*{Simulated annealing: independently repeated searches}
Each of ten independent runs per network uses four random restarts and 512 single-bit proposals per restart. Metropolis acceptance is $\min\{1,e^{-\Delta J/T}\}$. Temperature decreases geometrically from $T_0$ to $10^{-3}T_0$, with $T_0=\max\{\operatorname{SD}(32\text{ random pilot scores}),0.001\}$. All-in-one proposals are rejected and consume a proposal step. The best visited valid partition, including pilot points, is retained. Each run uses a fresh cached oracle; it receives neither the optimum nor the reference table. Maximum budget: 2,048 proposals plus 36 pilot/initial evaluations.
[Context excerpt; full source linked.]Exact original notation
m=n-1