Hunt, H. B.
Overview
Works:  52 works in 78 publications in 1 language and 74 library holdings 

Roles:  Author 
Classifications:  QA3, 510.782 
Publication Timeline
.
Most widely held works by
H. B Hunt
On the time and tape complexity of languages by
H. B Hunt(
Book
)
2 editions published in 1973 in English and held by 6 WorldCat member libraries worldwide
(1) the relationship between the classes of languages accepted by deterministic and nondeterministic polynomial time bounded Turing machines
2 editions published in 1973 in English and held by 6 WorldCat member libraries worldwide
(1) the relationship between the classes of languages accepted by deterministic and nondeterministic polynomial time bounded Turing machines
On the complexity of finite, pushdown, and stack automata by
H. B Hunt(
Book
)
6 editions published in 1975 in English and held by 5 WorldCat member libraries worldwide
The complexity of predicates on the 1way finite, pushdown, and stack automata languages is studied. Every nontrivial predicate on the 1way stack languages is shown to require exponential time, when applied to the stack automata, indexed grammars, or OImacro grammars. Every nontrivial predicate on the contextfree languages requires as much time and space as any 2way pushdown automaton language
6 editions published in 1975 in English and held by 5 WorldCat member libraries worldwide
The complexity of predicates on the 1way finite, pushdown, and stack automata languages is studied. Every nontrivial predicate on the 1way stack languages is shown to require exponential time, when applied to the stack automata, indexed grammars, or OImacro grammars. Every nontrivial predicate on the contextfree languages requires as much time and space as any 2way pushdown automaton language
Asymptotic bounds on the size of binary decision diagrams representing Boolean functions by
Y Breitbart(
Book
)
4 editions published in 1990 in English and held by 3 WorldCat member libraries worldwide
4 editions published in 1990 in English and held by 3 WorldCat member libraries worldwide
On the generalized probability problem with application to testing and reliability analysis by S Chakravarty(
Book
)
2 editions published in 1987 in English and held by 3 WorldCat member libraries worldwide
2 editions published in 1987 in English and held by 3 WorldCat member libraries worldwide
On computing test vectors for multiple faults in gate level combinational circuits by
Sreejit Chakravarty(
Book
)
2 editions published in 1987 in English and held by 3 WorldCat member libraries worldwide
2 editions published in 1987 in English 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
1 edition published in 1986 in English and held by 2 WorldCat member libraries worldwide
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
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
)
2 editions published in 1989 in English and held by 2 WorldCat member libraries worldwide
2 editions 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
)
2 editions published in 1992 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1992 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
1 edition published in 1986 in English and held by 2 WorldCat member libraries worldwide
An algebraic model for combinatorial problems by
R. E Stearns(
Book
)
2 editions 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."
2 editions 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."
The complexity of processing hierarchical specifications by
Daniel J Rosenkrantz(
Book
)
2 editions 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]."
2 editions 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]."
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."
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."
The LBA problem and its importance in the theory of computing by
Juris Hartmanis(
Book
)
3 editions published in 1973 in English and held by 2 WorldCat member libraries worldwide
In this paper we study the classic problem of determining whether the deterministic and nondeterministic contextsensitive languages are the same or, equivalently, whether the languages accepted by deterministic and nondeterministic linearly bounded automata are the same. We show that this problem is equivalent to several other natural problems in the theory of computing and that the techniques used on the LBA problem have several other applications in complexity theory. For example, we show that there exists a hardesttape recognizable nondeterministic contextsensitive language $L_{1}$, such that $L_{1}$ is a deterministic contextsensitive language if and only if the deterministic and nondeterministic contextsensitive languages are the same. We show furthermore, that many decision problems about sets described by regular expressions are instances of these tapehardest recognizable contextsensitive languages. Thus, it follows that nondeterminism in Turing machine computations (using at least linear tape) can not save memory over deterministic Turing machine computations if and only if the equivalence of regular expressions can be decided by a deterministic linearly bounded automaton. It also follows that the equivalence of regular expressions can be decided by a nondeterministic linearly bounded automaton if and only if the family of contextsensitive languages is closed under complementation
3 editions published in 1973 in English and held by 2 WorldCat member libraries worldwide
In this paper we study the classic problem of determining whether the deterministic and nondeterministic contextsensitive languages are the same or, equivalently, whether the languages accepted by deterministic and nondeterministic linearly bounded automata are the same. We show that this problem is equivalent to several other natural problems in the theory of computing and that the techniques used on the LBA problem have several other applications in complexity theory. For example, we show that there exists a hardesttape recognizable nondeterministic contextsensitive language $L_{1}$, such that $L_{1}$ is a deterministic contextsensitive language if and only if the deterministic and nondeterministic contextsensitive languages are the same. We show furthermore, that many decision problems about sets described by regular expressions are instances of these tapehardest recognizable contextsensitive languages. Thus, it follows that nondeterminism in Turing machine computations (using at least linear tape) can not save memory over deterministic Turing machine computations if and only if the equivalence of regular expressions can be decided by a deterministic linearly bounded automaton. It also follows that the equivalence of regular expressions can be decided by a nondeterministic linearly bounded automaton if and only if the family of contextsensitive languages is closed under complementation
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
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
)
2 editions published in 1991 in English and held by 2 WorldCat member libraries worldwide
2 editions published in 1991 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
)
2 editions published in 1991 in English and held by 2 WorldCat member libraries worldwide
Abstract: "Efficient algorithms are presented for solving systems of linear equations defined on and for solving path problems [11] for treewidth k graphs [20] and for [alpha]nearplanar graphs [22]. These algorithms include the following: 1. O(nk²) and O(n[superscript (3/2)]) time algorithms for solving a system of linear equations and for solving the single source shortest path problem, 2. O(n²k) and O(n²log n) time algorithms for computing A[superscript( 1)] where A is an n x n matrix over a field or for computing A[superscript *] where A is an n x n matrix over a closed semiring, and
2 editions published in 1991 in English and held by 2 WorldCat member libraries worldwide
Abstract: "Efficient algorithms are presented for solving systems of linear equations defined on and for solving path problems [11] for treewidth k graphs [20] and for [alpha]nearplanar graphs [22]. These algorithms include the following: 1. O(nk²) and O(n[superscript (3/2)]) time algorithms for solving a system of linear equations and for solving the single source shortest path problem, 2. O(n²k) and O(n²log n) time algorithms for computing A[superscript( 1)] where A is an n x n matrix over a field or for computing A[superscript *] where A is an n x n matrix over a closed semiring, and
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
1 edition published in 1986 in English and held by 2 WorldCat member libraries worldwide
Generalized predicate sets, structure trees, and graph and hypergraph coloring problems by
H. B Hunt(
Book
)
2 editions 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."
2 editions 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."
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
1 edition published in 1987 in English and held by 2 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Rosenkrantz, D. J. Author
 Stearns, R. E. Author
 Chakravarty, Sreejit Author
 Chakravarty, S. Author
 Ravi, S. S. Author
 Radhakrishnan, Venkatesh Author
 Stearns, Richard (Richard E.)
 Hartmanis, Juris Author
 Breitbart, Y. Author
 Bernhard, P. J. Author
Associated Subjects
Algebra Algebra, Boolean Algorithms Combinatorial analysis Combinatorial optimization Computational complexity Computational linguistics Computer algorithms Computer networks Data structures (Computer science) Dynamic programming Electronic circuits Electronic data processing Formal languages Hypergraphs Logic circuits Machine theory Mathematical linguistics Matrices Metal oxide semiconductors Multiprocessors NPcomplete problems Programming languages (Electronic computers) Signal detection Trees (Graph theory) Turing machines