Solving the subset-sum problem with a light-based device (Q1024028)
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 5565170
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving the subset-sum problem with a light-based device |
scientific article; zbMATH DE number 5565170 |
Statements
Solving the subset-sum problem with a light-based device (English)
0 references
16 June 2009
0 references
unconventional computing
0 references
optical solutions
0 references
NP-complete
0 references
subset sum
0 references
0 references
0.9005182385444641
0 references
0.8112256526947021
0 references
0.774307370185852
0 references
0.7583279609680176
0 references
0.7574228644371033
0 references
