Rodríguez, Carlos and Villagra, Marcos and Barán, Benjamín (2008) Asynchronous Team Algorithms for Boolean Satisfiability. In: 2nd International ICST Conference on Bio-Inspired Models of Network, Information, and Computing Systems.
![[thumbnail of 1572.pdf]](http://eprints.eai.eu/style/images/fileicons/application_pdf.png "1572.pdf")
PDF
1572.pdf
Download (1MB)
Abstract
The Boolean Satisfiability Problem or SAT is one of the most important problems in computer science. Nowadays, there are different types of algorithms to solve instances with thousands of variables, and much research is being carried out looking for more efficient algorithms to solve larger and hard
| Item Type: | Conference or Workshop Item (UNSPECIFIED) |
|---|---|
| Date Deposited: | 04 Mar 2026 08:39 |
| Last Modified: | 18 Apr 2026 04:34 |
| URI: | http://eprints.eai.eu/id/eprint/263 |
Actions (login required)
- View Item