Parallel unit propagation: Optimal speedup 3CNF Horn SAT
| dc.contributor.author | Vishkin, Uzi | |
| dc.date.accessioned | 2021-05-30T13:15:53Z | |
| dc.date.available | 2021-05-30T13:15:53Z | |
| dc.date.issued | 2021-05-01 | |
| dc.description.abstract | A linear work parallel algorithm for 3CNF Horn SAT is presented, which is interesting since the problem is P-complete. | en_US |
| dc.identifier | https://doi.org/10.13016/mbix-pfmc | |
| dc.identifier.uri | http://hdl.handle.net/1903/27097 | |
| dc.language.iso | en_US | en_US |
| dc.relation.isAvailableAt | College of Computer, Mathematical & Natural Sciences | en_us |
| dc.relation.isAvailableAt | Computer Science | en_us |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_us |
| dc.relation.isAvailableAt | University of Maryland (College Park, MD) | en_us |
| dc.subject | Horn SAT | en_US |
| dc.subject | Parallel Algorithms | en_US |
| dc.title | Parallel unit propagation: Optimal speedup 3CNF Horn SAT | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- linear work parallel HornSAT algorithm.pdf
- Size:
- 224.9 KB
- Format:
- Adobe Portable Document Format
- Description:
- Main article
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.57 KB
- Format:
- Item-specific license agreed upon to submission
- Description: