Physical Portrayal of Computational Complexity

<table>The network representing the class <svg height="10.325" id="M442" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 25.049999 10.325" width="25.049999" xmlns="http://www.w3.org/2000/svg">
<g transform="matrix(1.25,0,0,-1.25,0,10.325)">
<g transform="translate(72,-63.74)">
<text transform="matrix(1,0,0,-1,-71.95,63.79)">
<tspan style="font-size: 12.50px; " x="0" y="0">𝑁</tspan>
<tspan style="font-size: 12.50px; " x="10.640053" y="0">𝑃</tspan>
</text>
</g>
</g>
</svg> problem (O) is reduced (<svg height="10.75" id="M443" style="vertical-align:-0.13794pt" version="1.1" viewbox="0 0 91.3125 10.75" width="91.3125" xmlns="http://www.w3.org/2000/svg">
<g transform="matrix(1.25,0,0,-1.25,0,10.75)">
<g transform="translate(72,-63.4)">
<text transform="matrix(1,0,0,-1,-71.95,63.59)">
<tspan style="font-size: 12.50px; " x="0" y="0">𝑂</tspan>
<tspan style="font-size: 12.50px; " x="14.953588" y="0">→</tspan>
<tspan style="font-size: 12.50px; " x="32.082699" y="0">𝐴</tspan>
<tspan style="font-size: 12.50px; " x="46.611183" y="0">→</tspan>
<tspan style="font-size: 12.50px; " x="63.740295" y="0">𝐵</tspan>
</text>
</g>
</g>
</svg>) to the network representing the class <svg height="10.325" id="M444" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 25.049999 10.325" width="25.049999" xmlns="http://www.w3.org/2000/svg">
<g transform="matrix(1.25,0,0,-1.25,0,10.325)">
<g transform="translate(72,-63.74)">
<text transform="matrix(1,0,0,-1,-71.95,63.79)">
<tspan style="font-size: 12.50px; " x="0" y="0">𝑁</tspan>
<tspan style="font-size: 12.50px; " x="10.640053" y="0">𝑃</tspan>
</text>
</g>
</g>
</svg>-complete problem by removing nodes along deterministic dissipative paths to yield a network of triangles.</table>

International Scholarly Research Notices

Physical Portrayal of Computational Complexity

Figure 6