Stearns, R. E.

Compiler design theory by Philip M Lewis ( Book )
2 editions published in 1976 in English and held by 649 libraries worldwide

Algebraic structure theory of sequential machines by Juris Hartmanis ( Book )
8 editions published between 1966 and 1967 in English and held by 501 libraries worldwide

An algebraic model for combinatorial problems by R. E Stearns ( Book )
2 editions published in 1992 in English and held by 3 libraries worldwide
Abstract: "A new algebraic model, called the 'generalized satisfiability problem' or 'GSP' model, is introduced for representing and solving combinatorial problems. The GSP model is an alternative to the common method in the literature of representing such problems as language recognition problems. In the GSP model, a problem instance is represented by a set of variables together with a set of terms, and the computational objective is to find a certain sum of products of terms over a commutative semiring. Each Boolean satisfiability problem, each nonserial optimization problem, many [0,1] linear programming problems, and many graph problems are directly representable as GSPs. Important properties of the GSP model include the following: 1. By varying the semiring, a number of complete problems in the complexity class NP, CoNP, D[superscript P], OPT-P, MAX SNP, MAX [PI]₁, PSPACE, and #PSPACE are directly representable as GSPs. 2. In the GSP model, one can naturally discuss the structure of individual problem instances. The structure of a GSP is displayed in a 'structure tree.' The smaller the 'weighted depth' or 'channelwidth' of the structure tree for a GSP instance, the faster the instance can be solved by any one of several generic algorithms. 3. The GSP model extends easily so as to apply to heirarchically-specified problems and enables solutions to instances of such problems to be found directly from the specification rather than from the (often exponentially) larger specified object."

Algebraic Structure Theory of Sequential Machines ( Book )
1 edition published in 1966 in English and held by 2 libraries worldwide

Algebraic structure of sequential machines by Juris Hartmanis ( Book )
1 edition published in 1966 in English and held by 2 libraries worldwide

On solving systems of linear equations and path problems for bounded treewidth graphs by Venkatesh Radhakrishnan ( Book )
1 edition published in 1992 in English and held by 2 libraries worldwide

Power indices, structure trees, and easier hard problems by R. E Stearns ( Book )
1 edition published in 1989 in English and held by 2 libraries worldwide

Routing linear permutations through the omega network in two passes by John Keohane ( Book )
1 edition published in 1988 in English and held by 2 libraries worldwide
Abstract: "The problem of routing permutations through an [Omega] network connecting a set of processors is studied in the framework of linear algebra. The class of linear permutations is defined, and it is shown that any linear permutation can be routed through the [Omega] network in two passes. Furthermore, the address of the intermediary processor for the routing can be found in O(n[superscript 4]), where n is the size of the address of a processor. The class of linear permutations contains the class of Bit Permute Complement permutations, and the address of the inermediary processor for routing Bit Permute Complement permutations can be found in O(n) time."

On SAT and the relative complexities of NP-hard problems by R. E Stearns ( Book )
1 edition published in 1987 in English and held by 2 libraries worldwide

On the complexity of the satisfiability problem and the structure of NP by R. E Stearns ( Book )
1 edition published in 1986 in English and held by 2 libraries worldwide