Homer, Steven

Available identifiers

zbMath Open homer.stevenMaRDI QIDQ161379

List of research outcomes

Publication	Date of Publication	Type
Finding a hidden code by asking questions	2024-01-29	Paper
https://portal.mardi4nfdi.de/entity/Q4619826	2019-02-07	Paper
Computability and complexity theory.	2011-10-18	Paper
Non-uniform reductions	2010-10-06	Paper
Nonuniform lower bounds for exponential time classes	2010-06-17	Paper
Fundamentals of Computation Theory	2006-10-20	Paper
Computability and complexity theory	2001-02-19	Paper
Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy	2000-03-22	Paper
https://portal.mardi4nfdi.de/entity/Q4259998	1999-09-08	Paper
https://portal.mardi4nfdi.de/entity/Q4256650	1999-08-08	Paper
Learning counting functions with queries	1998-07-22	Paper
Oracles That Compute Values	1998-02-10	Paper
https://portal.mardi4nfdi.de/entity/Q4359459	1997-10-08	Paper
Scalability and the isomorphism problem	1997-02-27	Paper
https://portal.mardi4nfdi.de/entity/Q5687254	1996-12-11	Paper
The bounded injury priority method and the learnability of unions of rectangles	1996-10-13	Paper
On reductions of NP sets to sparse sets	1995-02-13	Paper
Immunity of complete problems	1995-01-12	Paper
Minimal pairs and complete problems	1994-09-25	Paper
On 1-truth-table-hard languages	1993-10-03	Paper
Almost-everywhere complexity hierarchies for nondeterministic time	1993-09-16	Paper
Oracles for structural properties: The isomorphism problem and public-key cryptography	1992-09-27	Paper
Doubly-periodic sequences and a class of two-dimensional cyclic codes	1992-09-26	Paper
https://portal.mardi4nfdi.de/entity/Q3975929	1992-06-26	Paper
Completeness for nondeterministic complexity classes	1992-06-26	Paper
https://portal.mardi4nfdi.de/entity/Q3355230	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3483270	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5753945	1990-01-01	Paper
Absolute results concerning one-way functions and their applications	1989-01-01	Paper
Honest polynomial degrees and \(P=?NP\)	1987-01-01	Paper
Minimal degrees for polynomial reducibilities	1987-01-01	Paper
On simple and creative sets in NP	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3026341	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3745831	1986-01-01	Paper
Doubly-Periodic Sequences and Two-Dimensional Recurrences	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3705435	1985-01-01	Paper
Oracle-dependent properties of the lattice of NP sets	1983-01-01	Paper
Intermediate β-r.e. degrees and the half-jump	1983-01-01	Paper
Relativizations comparing NP and exponential time	1983-01-01	Paper
Quadratic automata	1982-01-01	Paper
Degrees of Non α‐Speedable Sets	1981-01-01	Paper
Two splitting theorems for beta-recursion theory	1980-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Homer, Steven