Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Probe Machine Based Computing Model for Solving Satisfiability Problem

From MaRDI portal
Publication:5117824
Jump to:navigation, search

DOI10.1007/978-981-15-3415-7_7OpenAlexW3014097961MaRDI QIDQ5117824

Jing Yang, Jianzhong Cui, Qiang Zhang, Xianya Geng, Zhi-Xiang Yin

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)



Uses Software

  • CUD@SAT






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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5117824&oldid=19649150"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 13:53.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki