The following pages link to Harry B. III Hunt (Q549706):
Displayed 50 items.
- (Q208910) (redirect page) (← links)
- Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems (Q549709) (← links)
- On the size of binary decision diagrams representing Boolean functions (Q673087) (← links)
- The complexity of equivalence for commutative rings (Q758209) (← links)
- The complexity of monadic recursion schemes: executability problems, nesting depth, and applications (Q792758) (← links)
- The complexity of monadic recursion schemes: Exponential time bounds (Q796301) (← links)
- Complexity of reachability problems for finite discrete dynamical systems (Q856411) (← links)
- Errata for the paper ``Predecessor existence problems for finite discrete dynamical systems''. (Q924687) (← links)
- Testing for grammatical coverings (Q1080663) (← links)
- An application of the planar separator theorem to counting problems (Q1108031) (← links)
- Observations on the complexity of regular expression problems (Q1149249) (← links)
- Compaction of message patterns into succinct representations for multiprocessor interconnection networks (Q1177085) (← links)
- On the equivalence, containment, and covering problems for the regular and context-free languages (Q1229100) (← links)
- The covering problem for linear context-free grammars (Q1232301) (← links)
- Economy of description by parsers, DPDA's, and PDA's (Q1239011) (← links)
- Complexity metatheorems for context-free grammar problems (Q1246270) (← links)
- Hierarchically specified unit disk graphs (Q1269904) (← links)
- Reachability problems for sequential dynamical systems with threshold functions. (Q1401231) (← links)
- On some special classes of sequential dynamical systems (Q1424252) (← links)
- Matrix multiplication for finite algebraic systems (Q1813190) (← links)
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. (Q1854505) (← links)
- Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs (Q1917245) (← links)
- Predecessor existence problems for finite discrete dynamical systems (Q2455591) (← links)
- Resource bounds and subproblem independence (Q2581008) (← links)
- (Q2741527) (← links)
- (Q2743972) (← links)
- Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version) (Q2817638) (← links)
- Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures (Q2958929) (← links)
- Exploiting structure in quantified formulas (Q3150284) (← links)
- On computing reliability-measures of Boolean circuits (Q3355966) (← links)
- The Complexity of Very Simple Boolean Formulas with Applications (Q3474280) (← links)
- (Q3597159) (← links)
- On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata (Q3698326) (← links)
- (Q3730018) (← links)
- Recursion Schemes and Recursive Programs are Exponentially Hard to Analyze (Q3732943) (← links)
- (Q3742714) (← links)
- Algebraic Structures with Hard Equivalence and Minimization Problems (Q3765245) (← links)
- Terminating Turing Machine Computations and the Complexity and/or decidability of Correspondence Problems, Grammars, and Program Schemes (Q3769965) (← links)
- On the Computational Complexity of Algebra on Lattices (Q3783337) (← links)
- (Q3868788) (← links)
- On the Computational Complexity of Program Scheme Equivalence (Q3893301) (← links)
- On the Complexity of Flowchart and Loop Program Schemes and Programming Languages (Q3933741) (← links)
- On the Decidability of Grammar Problems (Q3962487) (← links)
- (Q4035344) (← links)
- (Q4055193) (← links)
- On the complexity of LR(k) testing (Q4080747) (← links)
- Operations on sparse relations (Q4120132) (← links)
- On the complexity of finite, pushdown, and stack automata (Q4121398) (← links)
- (Q4122837) (← links)
- On Equivalence and Containment Problems for Formal Languages (Q4131690) (← links)