activity
20162026
most citedTransformer-based Machine Learning for Fast SAT Solvers and Logic Synthesis

4 citations · 10 across the 12 of their papers we have counts for

collaborators
Showing 2022Show all

5 papers · 1 filter

math.DS2022★ 1 cited

Constructing Dynamical Systems to Model Higher Order Ising Spin Interactions and their Application in Solving Combinatorial Optimization Problems

Mohammad Khairul Bashar, Nikhil Shukla

The Ising model provides a natural mapping for many computationally hard combinatorial optimization problems (COPs). Consequently, dynamical system-inspired computing models and ha…

math.DS2022★ 1 cited

Formulating Oscillator-Inspired Dynamical Systems to Solve Boolean Satisfiability

Mohammad Khairul Bashar, Zongli Lin, Nikhil Shukla

Dynamical systems can offer a novel non-Boolean approach to computing. Specifically, the natural minimization of energy in the system is a valuable property for minimizing the obje…

physics.app-ph2022

Dynamical system-based computational models for solving combinatorial optimization on hypergraphs

Mohammad Khairul Bashar, Antik Mallick, Avik W. Ghosh +1

The intrinsic energy minimization in dynamical systems offers a valuable tool for minimizing the objective functions of computationally challenging problems in combinatorial optimi…

math.OC2022

Computational Models based on Synchronized Oscillators for Solving Combinatorial Optimization Problems

Antik Mallick, Mohammad Khairul Bashar, Zongli Lin +1

The equivalence between the natural minimization of energy in a dynamical system and the minimization of an objective function characterizing a combinatorial optimization problem o…

physics.app-ph2022★ 1 cited

CMOS-Compatible Ising Machines built using Bistable Latches Coupled through Ferroelectric Transistor Arrays

Antik Mallick, Zijian Zhao, Mohammad Khairul Bashar +8

Realizing compact and scalable Ising machines that are compatible with CMOS-process technology is crucial to the effectiveness and practicality of using such hardware platforms for…