Probe Machine Based Computing Model for Solving Satisfiability Problem

DOI10.1007/978-981-15-3415-7_7MaRDI QIDQ5117824zbMATH OpenOpenAlexFDO

Authors Jianzhong Cui, Zhixiang Yin, Jing Yang, Xianya Geng, Qiang Zhang

Publication date 26 August 2020

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-981-15-3415-7_7

zbMATH Keywords

NP-completesatisfiabilitysearch treeprobe machine

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Describes a project that uses

Uses Software

• CUD@SAT

This page was built for publication: Probe Machine Based Computing Model for Solving Satisfiability Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5117824)