James S. Royer

Available identifiers

zbMath Open royer.james-sMaRDI QIDQ579919

List of research outcomes

Publication	Date of Publication	Type
Adventures in time and space	2017-08-21	Paper
Program Size Complexity of Correction Grammars in the Ershov Hierarchy	2016-08-17	Paper
Axiomatizing Resource Bounds for Measure	2011-09-09	Paper
Learning Theory and Kernel Machines	2010-03-23	Paper
Two algorithms in search of a type-system	2009-10-19	Paper
Time-Complexity Semantics for Feasible Affine Recursions	2007-11-13	Paper
Adventures in time and space	2007-10-11	Paper
Generality's price: Inescapable deficiencies in machine-learned programs	2006-04-28	Paper
Every polynomial-time 1-degree collapses if and only if P = PSPACE	2005-08-29	Paper
On the computational complexity of Longley's \(H\) functional	2004-08-06	Paper
On characterizations of the basic feasible functionals. I	2002-09-11	Paper
https://portal.mardi4nfdi.de/entity/Q4224900	1999-08-31	Paper
A hierarchy based on output multiplicity	1999-01-12	Paper
The isomorphism conjecture fails relative to a random oracle	1998-02-02	Paper
https://portal.mardi4nfdi.de/entity/Q4359461	1997-10-08	Paper
Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals	1997-08-03	Paper
On closure properties of bounded two-sided error complexity classes	1995-12-13	Paper
https://portal.mardi4nfdi.de/entity/Q4310702	1994-11-01	Paper
On 1-truth-table-hard languages	1993-10-03	Paper
Two recursion theoretic characterizations of proof speed-ups	1989-01-01	Paper
Collapsing degrees	1988-01-01	Paper
A connotational theory of program structure	1987-01-01	Paper
How to prove representation-independent independence results	1987-01-01	Paper
Inductive inference of approximations	1986-01-01	Paper

Research outcomes over time

This page was built for person: James S. Royer