James S. Royer

From MaRDI portal
Person:579919

Available identifiers

zbMath Open royer.james-sMaRDI QIDQ579919

List of research outcomes





PublicationDate of PublicationType
Adventures in time and space2017-08-21Paper
Program Size Complexity of Correction Grammars in the Ershov Hierarchy2016-08-17Paper
Axiomatizing Resource Bounds for Measure2011-09-09Paper
Learning Theory and Kernel Machines2010-03-23Paper
Two algorithms in search of a type-system2009-10-19Paper
Time-Complexity Semantics for Feasible Affine Recursions2007-11-13Paper
Adventures in time and space2007-10-11Paper
Generality's price: Inescapable deficiencies in machine-learned programs2006-04-28Paper
Every polynomial-time 1-degree collapses if and only if P = PSPACE2005-08-29Paper
On the computational complexity of Longley's \(H\) functional2004-08-06Paper
On characterizations of the basic feasible functionals. I2002-09-11Paper
https://portal.mardi4nfdi.de/entity/Q42249001999-08-31Paper
A hierarchy based on output multiplicity1999-01-12Paper
The isomorphism conjecture fails relative to a random oracle1998-02-02Paper
https://portal.mardi4nfdi.de/entity/Q43594611997-10-08Paper
Semantics vs syntax vs computations: Machine models for type-2 polynomial-time bounded functionals1997-08-03Paper
On closure properties of bounded two-sided error complexity classes1995-12-13Paper
https://portal.mardi4nfdi.de/entity/Q43107021994-11-01Paper
On 1-truth-table-hard languages1993-10-03Paper
Two recursion theoretic characterizations of proof speed-ups1989-01-01Paper
Collapsing degrees1988-01-01Paper
A connotational theory of program structure1987-01-01Paper
How to prove representation-independent independence results1987-01-01Paper
Inductive inference of approximations1986-01-01Paper

Research outcomes over time

This page was built for person: James S. Royer