@@ -577,8 +577,8 @@ def spin(self) -> 'BinaryQuadraticModel':
577577 This example exploits the simplicity of the Ising representation of
578578 a Boolean NOT gate, :math:`s_1s_2`, relative to its QUBO counterpart,
579579 :math:`2x_1x_2−x_1−x_2+1`, to change a QUBO representation of an AND
580- gate, derived in the :std:doc:`Ocean documentation's <oceandocs:index>`
581- :ref:`AND example <oceandocs:and>`, to represent a NAND gate.
580+ gate, derived in the :ref:`AND example <qpu_example_and>`, to
581+ represent a NAND gate.
582582
583583 >>> Q = [[0, 1, -2], [0, 0, -2], [0, 0, 3]]
584584 >>> x = dimod.BinaryArray(["in1", "in2", "out_and"])
@@ -1135,7 +1135,7 @@ def maximum_energy_delta(self) -> Bias:
11351135 result from flipping a single variable in a binary quadratic model.
11361136
11371137 The bound is useful as a starting point for determining the values of
1138- `penalty parameters`_ in a `penalty model`_ .
1138+ `penalty parameters`_ in a :ref: `penalty model <concept_penalty>` .
11391139
11401140 Returns:
11411141 Bound on change in energy.
@@ -1147,8 +1147,6 @@ def maximum_energy_delta(self) -> Bias:
11471147 5.5
11481148
11491149 .. _`penalty parameters`: https://en.wikipedia.org/wiki/Penalty_method
1150- .. _`penalty model`: https://docs.ocean.dwavesys.com/en/stable/concepts/index.html#term-Penalty-model
1151-
11521150 """
11531151 if not self .num_variables :
11541152 return 0
@@ -2656,11 +2654,11 @@ def Binaries(labels: Union[int, Iterable[Variable]],
26562654
26572655 Examples:
26582656 This example generates a BQM that represents a Boolean NOT gate as a
2659- penalty model, :math:`2xy - x - y`, described in
2660- :std:doc:`Ocean documentation's <oceandocs:index>`
2661- :ref:`NOT example <oceandocs:not>`. The output of the brute-force solver,
2662- :class:`~dimod.reference.samplers.ExactSolver`, shows that best
2663- solutions are for assignments of the variables where :math:`z = \overline{x}`.
2657+ penalty model, :math:`2xy - x - y`, described in the
2658+ :ref:`NOT example <qpu_example_not>` section. The output of the
2659+ brute-force solver, :class:`~dimod.reference.samplers.ExactSolver` ,
2660+ shows that best solutions are for assignments of the variables where
2661+ :math:`z = \overline{x}`.
26642662
26652663 >>> x, y = dimod.Binaries(["x", "y"])
26662664 >>> bqm = 2*x*y - x - y
@@ -2704,8 +2702,7 @@ def BinaryArray(labels: Union[int, Iterable[Variable]],
27042702 0 & 0 & 3
27052703 \\end{bmatrix},
27062704
2707- derived in the :std:doc:`Ocean documentation's <oceandocs:index>`
2708- :ref:`AND example <oceandocs:and>`.
2705+ derived in the :ref:`AND example <qpu_example_and>` section.
27092706
27102707 >>> Q = [[0, 1, -2], [0, 0, -2], [0, 0, 3]]
27112708 >>> x = dimod.BinaryArray(["in1", "in2", "out"])
@@ -2758,8 +2755,7 @@ def Spins(labels: Union[int, Iterable[Variable]],
27582755 Examples:
27592756 This example generates a BQM that represents the constraint :math:`s_1 = s_2`
27602757 as a penalty model, :math:`-\\ frac{1}{2}s_1s_2`, described in the
2761- :std:doc:`system documentation's <sysdocs_gettingstarted:index>`
2762- :std:doc:`sysdocs_gettingstarted:doc_getting_started` guide.
2758+ :ref:`concept_penalty` section.
27632759 The output of the brute-force solver,
27642760 :class:`~dimod.reference.samplers.ExactSolver`, shows that best
27652761 solutions are for eqaul assignments of the variables' values.
0 commit comments