The complexity of very simple boolean formulas with applications von HUNT, H. B. III, STEARN, R. E

Volltext

On the computational complexity of algebra on lattices von HUNT, H. B. III, ROSENKRANTZ, D. J, BLONIARZ, P. A

Volltext

Simple heuristics for unit disk graphs von Marathe, M. V., Breu, H., Hunt III, H. B., Ravi, S. S., Rosenkrantz, D. J.

Volltext

On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata von Stearns, R. E., Hunt III, H. B.

Volltext

Approximation algorithms for degree-constrained minimum-cost network-design problems von RAVI, R, MARATHE, M. V, RAVI, S. S, ROSENKRANTZ, D. J, HUNT, H. B

Volltext

Recursion schemes and recursive programs are exponentially hard to analyze von HUNT, H. B. III, ROSENKRANTZ, D. J

Volltext

Nonlinear algebra and optimization on rings are «hard von HUNT, H. B, STEARNS, R. E

Volltext

Terminating turing machine computations and the complexity and/or decidability of correspondence problems, grammars, and program schemes von HUNT, H. B. III

Volltext

Algebraic structures with hard equivalence and minimization problems von BLONIARZ, P. A, HUNT, H. B. III, ROSENKRANTZ, D. J

Volltext

Computational Parallels between the Regular and Context-Free Languages von Hunt, III, H. B., Rosenkrantz, D. J.

Volltext

On the Computational Complexity of Program Scheme Equivalence von Hunt III, H. B., Constable, R. L., Sahni, S.

Volltext

Complexity classes in optimizationComplexity Classes in Optimization von Hunt III, H. B.

Volltext

A note on detecting sneak paths in transistor networks von Chakravarty, S., Hunt, H.B.

Volltext

On the Decidability of Grammar Problems von Hunt, H. B.

Volltext

On the equivalence and containment problems for unambigous regular expressions, regular grammars and finite automata von STEARNS, R. E, HUNT, H. B. III

Volltext

The complexity of generating minimum test sets for PLA's and monotone combinational circuits von Chakravarty, S., Hunt, H.B., Ravi, S.S., Rosenkrantz, D.J.

Volltext

An application of the planar separator theorem to counting problems von Ravi, S.S., Hunt, H.B.

Volltext

Matrix multiplication for finite algebraic systems von Rosenkrantz, Daniel J., Hunt, Harry B.

Volltext

On the Complexity of Finite, Pushdown, and Stack Automata von Hunt,H B , III

Volltext bestellen

Testing for grammatical coverings von ROSENKRANTZ, D. J, HUNT, H. B. III

Volltext