The following pages link to Harry B. III Hunt (Q549706):
Displayed 38 items.
- (Q4133129) (← links)
- (Q4133162) (← links)
- (Q4133163) (← links)
- (Q4134979) (← links)
- (Q4140366) (← links)
- Lower Bounds and Reductions Between Grammar Problems (Q4140408) (← links)
- Computational Parallels between the Regular and Context-Free Languages (Q4151734) (← links)
- Polynomial Algorithms for Deterministic Pushdown Automata (Q4167604) (← links)
- Corrigendum: `` Lower Bounds and Reductions Between Grammar Problems'' (Q4170257) (← links)
- The Complexity of Processing Hierarchical Specifications (Q4202216) (← links)
- Nonlinear Algebra and Optimization on Rings are “Hard” (Q4205079) (← links)
- The Complexity of Planar Counting Problems (Q4210088) (← links)
- Approximation Algorithms for PSPACE-Hard Hierarchically and Periodically Specified Problems (Q4210093) (← links)
- Bicriteria Network Design Problems (Q4216149) (← links)
- (Q4258576) (← links)
- (Q4331197) (← links)
- (Q4375760) (← links)
- (Q4375775) (← links)
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs (Q4386448) (← links)
- (Q4406683) (← links)
- (Q4451017) (← links)
- (Q4470517) (← links)
- (Q4527194) (← links)
- The complexity of approximating PSPACE-complete problems for hierarchical specifications (Q4630250) (← links)
- Simple heuristics for unit disk graphs (Q4698229) (← links)
- (Q4729350) (← links)
- (Q4764625) (← links)
- (Q4785459) (← links)
- (Q4818858) (← links)
- An Algebraic Model for Combinatorial Problems (Q4877529) (← links)
- Efficient algorithms for solving systems of linear equations and path problems (Q5096775) (← links)
- Sums-of-Products and Subproblem Independence (Q5192363) (← links)
- Many birds with one stone (Q5248513) (← links)
- A note on detecting sneak paths in transistor networks (Q5375481) (← links)
- Power indices and easier hard problems (Q5751941) (← links)
- Approximation algorithms for degree-constrained minimum-cost network-design problems (Q5946123) (← links)
- On the undecidability and descriptional complexity of synchronized regular expressions (Q6171822) (← links)
- Hierarchically specified unit disk graphs (Q6184390) (← links)