Using clausal graphs to determine the computational complexity of k-bounded positive one-in-three SAT
| Autor: | Denman, Richard, Foster, Stephen |
|---|---|
| Zdroj: | In Discrete Applied Mathematics 2009 157(7):1655-1659 |
| Databáze: | ScienceDirect |
| Externí odkaz: |
|
| Autor: | Denman, Richard, Foster, Stephen |
|---|---|
| Zdroj: | In Discrete Applied Mathematics 2009 157(7):1655-1659 |
| Databáze: | ScienceDirect |
| Externí odkaz: |
|
Full Text from ScienceDirect