„Implicit computational complexity“
Suchergebnisse
1.000+ Treffer
-
Quantum Programming in Polylogarithmic Time
-
Characterizing Small Circuit Classes from FAC⁰ to FAC¹ via Discrete Ordinary Differential Equations
-
Branch Sequentialization in Quantum Polytime
-
A New Characterization of FAC⁰ via Discrete Ordinary Differential Equations
-
mwp-Analysis Improvement and Implementation: Realizing Implicit Computational Complexity
-
Enumerating Error Bounded Polytime Algorithms Through Arithmetical Theories
-
Λ-Symsym: An Interactive Tool for Playing with Involutions and Types
-
Combining Linear Logic and Size Types for Implicit Complexity
-
Free-Cut Elimination in Linear Logic and an Application to a Feasible Arithmetic
-
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length: The General Purpose Analog Computer and Computable Analysis Are Two Efficiently Equivalent Models of Computations
-
Simple Parsimonious Types and Logarithmic Space
-
Polynomial Time in the Parametric Lambda Calculus
-
On Sharing, Memoization, and Polynomial Time
-
ML with PTIME complexity guarantees
-
On the Invariance of the Unitary Cost Model for Head Reduction
-
A Path Order for Rewrite Systems that Compute Exponential Time Functions
-
Analyzing the Implicit Computational Complexity of object-oriented programs
-
Complexity Analysis of Regularization Methods for Implicitly Constrained Least Squares
-
Implicit characterizations of FPTIME and NC revisited
-
Implicit characterizations of FPTIME and NC revisited