Royer, James S. - Department of Electrical Engineering and Computer Science, Syracuse University

• On Characterizations of the Basic Feasible Functionals
• On the Computational Complexity of Longley's H Functional
• An Algebraic Approach to the Constraint Satisfaction Matt Valeriote
• Every PolynomialTime 1Degree Collapses if and only if P = PSPACE
• Adventures in Time and Space Norman Danner
• The Isomorphism Conjecture Fails Relative to a Random Oracle
• A Hierarchy Based on Output Multiplicity
• CIS 720 Class Notes Spring 1997
• ADVENTURES IN TIME & SPACE Syracuse University
• Resolution and Clause Learning
• CIS 720 Class Notes Spring 1997 6. Unsolvable Problems
• Systems That Learn An Introduction to Learning Theory
• Generality's Price: Inescapable De ciencies in
• THE WHY AND HOW OF HIGHERTYPE COMPLEXITY THEORY
• On Characterizations of the Basic Feasible Functionals,
• Functions Definable in the SimplyTyped Lambda Calculus
• On Characterizations of the Basic Feasible Functionals,
• THE WHY AND HOW OF HIGHER-TYPE COMPLEXITY THEORY
• Generality's Price: Inescapable Deficiencies in
• On Characterizations of the Basic Feasible Functionals
• Average Dependence and Random Oracles Preliminary Report
• Separating Notions of HigherType PolynomialTime Revised Extended Abstract
• On Characterizations of the Basic Feasible Functionals
• Semantics vs. Syntax vs. Computations Machine Models for Type2 PolynomialTime Bounded Functionals
• The Structure of Complete Stuart A. Kurtz 1
• SEQUENTIALITY Syracuse University
• On the Computational Complexity of Longley's H Functional
• CIS 720 Class Notes Spring 1997 The following section was thrown
• On Type2 Complexity Classes Preliminary Report
• Active Transport in Biological Computing (Preliminary Version)
• Every PolynomialTime 1Degree Collapses if and only if P = PSPACE
• Meta-Finite Model Expansion (Preliminary Report)
• Adventures in Time and Space Norman Danner
• This is page i Printer: Opaque this
• The MyhillShepherdson and KreiselLacombeSchoenfield Theorems
• On Closure Properties of Bounded 2Sided Error Complexity Classes
• Semantics vs. Syntax vs. Computations Machine Models for Type2 PolynomialTime Bounded Functionals
• SEQUENTIALITY Sequentiality