Lars Kristiansen

From MaRDI portal
Person:207724

Available identifiers

zbMath Open kristiansen.larsMaRDI QIDQ207724

List of research outcomes

PublicationDate of PublicationType
On representations of real numbers and the computational complexity of converting between such representations2023-04-14Paper
On interpretability between some weak essentially undecidable theories2022-12-16Paper
On the complexity of conversion between classic real number representations2022-12-16Paper
On subrecursive representation of irrational numbers: contractors and Baire sequences2022-03-22Paper
Reversible programming languages capturing complexity classes2021-07-05Paper
First-order concatenation theory with bounded quantifiers2021-01-19Paper
On subrecursive representability of irrational numbers, part II2019-10-28Paper
Decidable and undecidable fragments of first-order concatenation theory2018-09-06Paper
Search for good examples of Hall’s conjecture2018-08-01Paper
Notes on Fragments of First-Order Concatenation Theory2018-04-17Paper
Subrecursive Approximations of Irrational Numbers by Variable Base Sums2018-04-15Paper
On subrecursive representability of irrational numbers2017-11-22Paper
A flow calculus of mwp -bounds for complexity analysis2015-09-17Paper
A Preliminary Report on Search for Good Examples of Hall's Conjecture2014-01-17Paper
ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS2013-06-06Paper
Non-determinism in Gödel's system \(T\)2012-12-07Paper
Degrees of Total Algorithms versus Degrees of Honest Functions2012-08-14Paper
Higher Types, Finite Domains and Resource-bounded Turing Machines2012-05-07Paper
Streamlined subrecursive degree theory2012-03-29Paper
Static Complexity Analysis of Higher Order Programs2010-09-14Paper
Complexity classes and fragments of C2009-07-09Paper
Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\)2009-05-08Paper
Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time2008-06-19Paper
Recursion in Higher Types and Resource Bounded Turing Machines2008-06-19Paper
The Structure of Detour Degrees2008-05-27Paper
Computer Science Logic2007-06-21Paper
Logical Approaches to Computational Barriers2007-04-30Paper
Theory and Applications of Models of Computation2007-04-30Paper
https://portal.mardi4nfdi.de/entity/Q54877262006-09-11Paper
https://portal.mardi4nfdi.de/entity/Q33707342006-02-08Paper
New Computational Paradigms2006-01-11Paper
New Computational Paradigms2006-01-11Paper
Neat function algebraic characterizations of LOGSPACE and LINSPACE2005-06-16Paper
Subrecursive degrees and fragments of Peano arithmetic2002-03-19Paper
https://portal.mardi4nfdi.de/entity/Q45039662000-11-09Paper
https://portal.mardi4nfdi.de/entity/Q42212371999-06-07Paper
A jump operator on honest subrecursive degrees1998-08-10Paper
https://portal.mardi4nfdi.de/entity/Q48931481997-06-26Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Lars Kristiansen