On efficient algorithms for SAT (Q4913846)
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 6154709
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On efficient algorithms for SAT |
scientific article; zbMATH DE number 6154709 |
Statements
On Efficient Algorithms for SAT (English)
0 references
16 April 2013
0 references
SAT-problem
0 references
membrane computing
0 references
efficiency
0 references
new computing paradigms
0 references
P-NP
0 references
regular languages
0 references
finite automata
0 references
uniform solution
0 references
0.8152264356613159
0 references
0.7872891426086426
0 references
0.7713611125946045
0 references
0.7706255316734314
0 references
0.7672513127326965
0 references
