Classical Machines, for Solving the Toughest Problems in Computer Science

Eli Yablonovitch; T. Patrick Xiao; Sri Krishna Vadlamani

doi:10.1364/fio.2019.jtu4a.114

Abstract

1 min read

Classical analog processors are now solving hard Computer Science problems that were thought to require a Quantum Computer. There are now classical machines that solve Ising type optimizations, opening the door toward other NP-hard problems as well.

Discussion(0)

No comments yet. Be the first to comment.

Related publications

Article1994

Computer as thinker/doer: problem-solving environments for computational science

Efstratios Gallopoulos, Elias N. Houstis, James R. Rice

IEEE Computational Science and Engineering

Article2013

A Discrete Firefly Algorithm for the Multi-Objective Hybrid Flowshop Scheduling Problems

M.K. Marichelvam, T. Prabaharan, Xin-she Yang

IEEE Transactions on Evolutionary Computation

Chapter in a book2012

Linear and Tree-Based Genetic Programming for Solving Geotechnical Engineering Problems

Amir H. Alavi, Amir Gandomi, Ali Mollahasani, Jafar Bolouri Bazaz

Article2020

Research impact and productivity of Benin according to the Science Citation Index Expanded (1973 to 2018)

Julían Mónge-Nájera, Eustache Mêgnigbêto, Yuh-shan Ho

Article2023

Firefly Algorithm for Beamforming Design in RIS-aided Communication Systems

Tuan Anh Le, Xin-she Yang

2022 IEEE 95th Vehicular Technology Conference: (VTC2022-Spring)