Richard Denman

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

2009

1 Richard Denman, Stephen Foster: Using clausal graphs to determine the computational complexity of k-bounded positive one-in-three SAT. Discrete Applied Mathematics 157(7): 1655-1659 (2009)

	2009
1		Richard Denman, Stephen Foster: Using clausal graphs to determine the computational complexity of k-bounded positive one-in-three SAT. Discrete Applied Mathematics 157(7): 1655-1659 (2009)

Coauthor Index

1 Stephen Foster [1]

Last update Tue May 29 20:41:18 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page