The following pages link to Richard E. Stearns (Q549708):
Displaying 50 items.
- Modeling and analyzing social network dynamics using stochastic discrete graphical dynamical systems (Q549709) (← links)
- (Q758208) (redirect page) (← links)
- The complexity of equivalence for commutative rings (Q758209) (← 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)
- Attributed translations (Q1218732) (← links)
- On finite strategy sets for finitely repeated zero-sum games. (Q1399527) (← links)
- Reachability problems for sequential dynamical systems with threshold functions. (Q1401231) (← links)
- On some special classes of sequential dynamical systems (Q1424252) (← links)
- A characterization of nested canalyzing functions with maximum average sensitivity (Q1627840) (← links)
- Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems. (Q1854505) (← links)
- Inferring local transition functions of discrete dynamical systems from observations of system behavior (Q2357112) (← 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)
- Complexity of Inferring Local Transition Functions of Discrete Dynamical Systems (Q2947406) (← 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)
- (Q3158988) (← links)
- The Voting Problem (Q3263757) (← links)
- Some dangers in state reduction of sequential machines (Q3290922) (← links)
- Consistency and Serializability in Concurrent Database Systems (Q3335024) (← links)
- Deterministic versus nondeterministic time and lower bound problems (Q3455557) (← 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)
- (Q3742714) (← links)
- Regularity preserving modifications of regular expressions (Q3849398) (← links)
- (Q3915993) (← links)
- (Q4062669) (← links)
- (Q4122730) (← links)
- An Analysis of Several Heuristics for the Traveling Salesman Problem (Q4140001) (← 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)
- (Q4258576) (← links)
- (Q4331197) (← links)
- (Q4375760) (← links)
- (Q4375775) (← links)
- NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs (Q4386448) (← links)
- (Q4451017) (← links)
- (Q4470517) (← links)
- (Q4527194) (← links)
- (Q4729350) (← 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)
