Louise Hay

According to our database, Louise Hay authored at least 16 papers between 1963 and 1991.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

1991

On Truth-Table Reducibility to SAT

Samuel R. Buss, Louise Hay

Inf. Comput., March, 1991

1989

Bounded query classes and the difference hierarchy.

Richard Beigel, William I. Gasarch, Louise Hay

Arch. Math. Log., 1989

1988

On truth-table reducibility to SAT and the difference hierarchy over NP.

Samuel R. Buss, Louise Hay

Proceedings of the Proceedings: Third Annual Structure in Complexity Theory Conference, 1988

1986

Meeting of the Association for Symbolic Logic: Chicago, 1985.

Andreas Blass, Louise Hay, Peter G. Hinman

J. Symb. Log., 1986

1982

On the Recursion-Theoretic Complexity of Relative Succinctness of Representations of Languages

Louise Hay

Inf. Control., January, 1982

A Topological Analog to the Rice-Shapiro Index Theorem.

Louise Hay, Douglas Miller

J. Symb. Log., 1982

1979

Extensional Characterization of Index Sets.

Louise Hay, Nancy Johnson

Math. Log. Q., 1979

ZLISP: A lisp for a Micro-computer.

Louise Hay, Richard Larson

Proceedings of the IEEE Computer Society's Third International Computer Software and Applications Conference, 1979

1978

Convex subsets of 2ⁿ and bounded truth-table reducibility.

Louise Hay

Discret. Math., 1978

1976

Boolean Combinations of R.E. Open Sets.

Louise Hay

J. Symb. Log., 1976

1975

Spectra and halting problems.

Louise Hay

Math. Log. Q., 1975

1974

A Noninitial Segment of Index Sets.

Louise Hay

J. Symb. Log., 1974

1972

A Note on Frame Extensions.

Louise Hay

J. Symb. Log., 1972

A Discrete Chain of Degrees of Index Sets.

Louise Hay

J. Symb. Log., 1972

1969

Index Sets of Finite Classes of Recursively Enumerable Sets.

Louise Hay

J. Symb. Log., 1969

1963

Axiomatization of the Infinite-Valued Predicate Calculus.

Louise Schmir Hay

J. Symb. Log., 1963