ISSN: 2310-757X
Please use this identifier to cite or link to this item:
http://elar.urfu.ru/handle/10995/51309| Title: | The far from most string problem |
| Authors: | Gorbenko, A. Popov, V. |
| Issue Date: | 2012 |
| Publisher: | Pleiades Publishing Ltd |
| Citation: | Gorbenko A. The far from most string problem / Anna Gorbenko, Vladimir Popov // Applied Mathematical Sciences. — 2012. — Vol. 6. — № 133-136. — P. 6719-6724. |
| Abstract: | In this paper we consider an approach to solve the far from most string problem. This approach is based on constructing logical models for the problem. |
| Keywords: | LOGICAL MODEL NP-COMPLETE SATISFIABILITY PROBLEM THE FAR FROM MOST STRING PROBLEM |
| URI: | http://elar.urfu.ru/handle/10995/51309 |
| SCOPUS ID: | 84869849863 |
| PURE ID: | 1070844 |
| ISSN: | 1312-885X |
| Appears in Collections: | Научные публикации ученых УрФУ, проиндексированные в SCOPUS и WoS CC |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 2-s2.0-84869849863.pdf | 75,06 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.