The complexity of generating minimum test sets for PLA's and monotone combinational circuits
Chakravarty, S., Hunt, H.B., Ravi, S.S., Rosenkrantz, D.J.
Published in IEEE transactions on computers (01.06.1989)
Published in IEEE transactions on computers (01.06.1989)
Get full text
Journal Article
On the computational complexity of algebra on lattices
HUNT, H. B. III, ROSENKRANTZ, D. J, BLONIARZ, P. A
Published in SIAM journal on computing (01.02.1987)
Published in SIAM journal on computing (01.02.1987)
Get full text
Journal Article
The complexity of planar counting problems
HUNT, H. B, MARATHE, M. V, RADHAKRISHNAN, V, STEARNS, R. E
Published in SIAM journal on computing (01.08.1998)
Published in SIAM journal on computing (01.08.1998)
Get full text
Journal Article
NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
Hunt, Harry B, Marathe, Madhav V, Radhakrishnan, Venkatesh, Ravi, S.S, Rosenkrantz, Daniel J, Stearns, Richard E
Published in Journal of algorithms (01.02.1998)
Published in Journal of algorithms (01.02.1998)
Get full text
Journal Article
Bicriteria Network Design Problems
Marathe, Madhav V, Ravi, R, Sundaram, Ravi, Ravi, S.S, Rosenkrantz, Daniel J, Hunt, Harry B
Published in Journal of algorithms (01.07.1998)
Published in Journal of algorithms (01.07.1998)
Get full text
Journal Article
Approximation algorithms for pspace-hard hierarchically and periodically specified problems
MARATHE, M. V, HUNT, H. B, STEARNS, R. E, RADHAKRISHNAN, V
Published in SIAM journal on computing (01.10.1998)
Published in SIAM journal on computing (01.10.1998)
Get full text
Journal Article