An efficient procedure for theorem proving in propositional logic on vector computers (Q808298)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4209639
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient procedure for theorem proving in propositional logic on vector computers |
scientific article; zbMATH DE number 4209639 |
Statements
An efficient procedure for theorem proving in propositional logic on vector computers (English)
0 references
1991
0 references
satisfiability
0 references
NP-complete
0 references
pipeline
0 references
divide-and-conquer
0 references
vector computers
0 references
vectorization
0 references
0.8502090573310852
0 references
0.7925622463226318
0 references
0.7659878134727478
0 references
