|
| << previous |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 106 of 106 found articles
| Title: |
Using clausal graphs to determine the computational complexity of k-bounded positive one-in-three SAT |
| Author: |
Denman, Richard Foster, Stephen |
| Appeared in: |
Discrete applied mathematics |
| Paging: | Volume 157 (2009) nr. 7 pages 5 p. |
| Year: |
2009 |
| Contents: | |
| Publisher: |
Elsevier B.V. |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 106 of 106 found articles
| << previous |