Hunt, H. B.Overview
Most widely held works by
H. B Hunt
On the complexity of finite, pushdown, and stack automata
by H. B Hunt
(
Book
)
4 editions published in 1975 in English and Undetermined and held by 3 WorldCat member libraries worldwide
Translation between circuit synthesis from Boolean function representations
by Sreejit Chakravarty
(
Book
)
1 edition published in 1986 in English and held by 2 WorldCat member libraries worldwide
Efficient algorithms for solving systems of linear equations and path problems
by Venkatesh Radhakrishnan
(
Book
)
1 edition published in 1991 in English and held by 2 WorldCat member libraries worldwide 3. O(n²k) and O(n²log n) time algorithms for the all pairs shortest path problems are solvable in O(n) and O(n²) steps, respectively, for any of the decomposable graph classes in [5]."
The complexity of very simple Boolean formulas with applications
by H. B Hunt
(
Book
)
1 edition published in 1987 in English and held by 2 WorldCat member libraries worldwide
Asymptotic bounds on the size of binary decision diagrams representing Boolean functions
by Y Breitbart
(
Book
)
2 editions published in 1990 in English and held by 2 WorldCat member libraries worldwide
Matrix multiplication for finite algebraic systems
by Daniel J Rosenkrantz
(
Book
)
1 edition published in 1987 in English and held by 2 WorldCat member libraries worldwide
On computing test vectors for multiple faults in gate level combinational circuits
by Sreejit Chakravarty
(
Book
)
1 edition published in 1987 in English and held by 2 WorldCat member 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 WorldCat member libraries worldwide
On the generalized probability problem with application to testing and reliability analysis
by S Chakravarty
(
Book
)
1 edition published in 1987 in English and held by 2 WorldCat member libraries worldwide
On representations of Boolean functions for the synthesis of MOS combinational circuits
by Sreejit Chakravarty
(
Book
)
1 edition published in 1986 in English and held by 2 WorldCat member libraries worldwide
Compaction of message patterns into spaceefficient representations for multiprocessor interconnection networks
by P. J Bernhard
(
Book
)
2 editions published in 1988 in English and held by 2 WorldCat member libraries worldwide Finally, we consider the more general problem of determining if a set of masks, which represents a set of addresses or messages, can be merged into a single mask. We show this problem to be NPhard. We also discuss the implementation of this formalism with respect to the efficient manipulation and transmission of message patterns on interconnection networks and for SIMD computers in general."
Generalized predicate sets, structure trees, and graph and hypergraph coloring problems
by H. B Hunt
(
Book
)
1 edition published in 1991 in English and held by 2 WorldCat member libraries worldwide Abstract: "We show how various ideas in [SH2] can be used to solve graph and hypergraph coloring problems, including computing chromatic polynomials, for a number of sets [gamma] of graphs and hypergraphs studied in the literature. Often, our algorithms for these problems use much less than 2[superscript cn] time, for any c> 0. This is true, even for sets [gamma], for which these coloring problems are NP or #Phard. Our results both extend and unify ideas for solving easier instances of hard graph problems using efficient separator theorems as in [LT2], [GHT], [RaH], etc., and treedecompositions in [RS], [ALS], [Bodl], [BLW], etc."
An algebraic model for combinatorial problems
by R. E Stearns
(
Book
)
1 edition published in 1992 in English and held by 2 WorldCat member 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], OPTP, 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 heirarchicallyspecified 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."
Application of planar separator theorem to counting problems
by S. S Ravi
(
Book
)
1 edition published in 1986 in English and held by 2 WorldCat member libraries worldwide
On computing reliability measures for digital circuits
by S Chakravarty
(
Book
)
1 edition published in 1986 in English and held by 2 WorldCat member 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 WorldCat member 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 WorldCat member libraries worldwide
The complexity of processing hierarchical specifications
by Daniel J Rosenkrantz
(
Book
)
1 edition published in 1989 in English and held by 2 WorldCat member libraries worldwide The problem of simulating hierarchically specified circuits is shown to be PSPACEcomplete but solvable deterministically in [formula] time for acyclic circuits, and to EXPSPACEcomplete for cyclic circuits. We also show that hierarchically specified acyclic circuits can be simulated deterministically in linear space in the size of the description, even when this description is not explicitly acyclic. Moreover, we show that every hierarchically specified acyclic circuit has an equivalent flat circuit of size [formula]. For binary circuits, the size of the equivalent flat circuit is [formula]."
The complexity of equivalence for commutative rings
by H. B Hunt
(
Book
)
1 edition published in 1987 in English and held by 2 WorldCat member libraries worldwide
The complexity of structural containment and equivalence
by Daniel J Rosenkrantz
(
Book
)
1 edition published in 1991 in English and held by 2 WorldCat member libraries worldwide more
fewer
Audience Level
Related Identities
Associated Subjects
Algebra Algebra, Boolean Algorithms Combinatorial optimization Commutative rings Computational complexity Computational linguistics Computer algorithms Computer networks Data structures (Computer science) Dynamic programming Electronic circuits Electronic data processing Hypergraphs Logic circuits Matrices Metal oxide semiconductors Multiprocessors NPcomplete problems Problem solving Programming languages (Electronic computers) Signal detection Trees (Graph theory)

Languages
