32-bit factorizer (IMAGE)

University of California - Santa Barbara

32-bit factorizer

Caption

Hard optimization problems can be expressed as interacting networks of probabilistic bits. Efficient solution of these problems require making them less dense at the expense of more p-bits

Credit

UC Santa Barbara

Usage Restrictions

For use with credit

License

Original content

Disclaimer: AAAS and EurekAlert! are not responsible for the accuracy of news releases posted to EurekAlert! by contributing institutions or for the use of any information through the EurekAlert system.