P. H. Hertling

From MaRDI portal
Person:1868529

Available identifiers

zbMath Open hertling.peter-hDBLP96/2423WikidataQ62554167 ScholiaQ62554167MaRDI QIDQ1868529

List of research outcomes





PublicationDate of PublicationType
Feasible real random access machines2024-06-21Paper
Nearly computable real numbers2024-04-15Paper
Remarks on the effective Jordan decomposition2023-04-20Paper
EXPSPACE-Completeness of the Logics K4 × S5 and S4 × S5 and the Logic of Subset Spaces2022-12-08Paper
Topological properties of the binary supremum function2022-07-05Paper
On the computational complexity of the range computation problem2020-12-15Paper
Forests describing Wadge degrees and topological Weihrauch degrees of certain classes of functions and relations2020-11-09Paper
EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 1: ESPACE-Algorithms2019-08-09Paper
EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 2: EXPSPACE-Hardness2019-08-09Paper
Clarke's generalized gradient and Edalat's L-derivative2017-05-18Paper
Effective subsets under homeomorphisms of \(\mathbb{R}^n\)2015-12-07Paper
https://portal.mardi4nfdi.de/entity/Q49823482015-04-09Paper
Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time2015-01-15Paper
A Comparison of Certain Representations of Regularly Closed Sets2013-04-19Paper
Complexity Issues for Preorders on Finite Labeled Forests2011-09-09Paper
https://portal.mardi4nfdi.de/entity/Q35754322010-07-27Paper
Computability theoretic properties of the entropy of gap shifts2008-06-11Paper
https://portal.mardi4nfdi.de/entity/Q53849842008-04-29Paper
https://portal.mardi4nfdi.de/entity/Q54222352007-10-17Paper
https://portal.mardi4nfdi.de/entity/Q53108822007-10-15Paper
A sequentially computable function that is not effectively continuous at any point2007-02-08Paper
A Banach-Mazur computable but not Markov computable function on the computable real numbers2005-02-23Paper
Is the Mandelbrot set computable?2005-02-16Paper
https://portal.mardi4nfdi.de/entity/Q47372232004-08-11Paper
Random elements in effective topological spaces with measure.2003-08-19Paper
Topological complexity of zero finding with algebraic operations2003-05-14Paper
Randomness on full shift spaces2003-04-28Paper
Topological properties of real number representations.2002-07-31Paper
A lower bound for range enclosure in interval arithmetic2002-07-15Paper
https://portal.mardi4nfdi.de/entity/Q45319812002-05-27Paper
A limitation for underestimation via twin arithmetic2001-12-03Paper
Nonlinear Lebesgue and Itô integration problems of high complexity2001-10-14Paper
Recursively enumerable reals and Chaitin \(\Omega\) numbers2001-08-20Paper
https://portal.mardi4nfdi.de/entity/Q45205312001-02-26Paper
https://portal.mardi4nfdi.de/entity/Q45205252001-02-26Paper
https://portal.mardi4nfdi.de/entity/Q45205292001-02-26Paper
https://portal.mardi4nfdi.de/entity/Q49385512000-09-15Paper
https://portal.mardi4nfdi.de/entity/Q49556042000-05-30Paper
https://portal.mardi4nfdi.de/entity/Q49420482000-03-19Paper
Standard representations of real numbers1999-11-29Paper
An effective Riemann Mapping Theorem1999-06-21Paper
Feasible real random access machines1999-06-13Paper
A Real Number Structure that is Effectively Categorical1999-05-24Paper
https://portal.mardi4nfdi.de/entity/Q42175981999-03-02Paper
https://portal.mardi4nfdi.de/entity/Q42190531999-02-14Paper
https://portal.mardi4nfdi.de/entity/Q38388361998-08-13Paper
https://portal.mardi4nfdi.de/entity/Q38379951998-08-02Paper
https://portal.mardi4nfdi.de/entity/Q43814021998-04-01Paper
https://portal.mardi4nfdi.de/entity/Q43556861997-11-20Paper
Topological complexity with continuous operations1997-05-25Paper
Small spanning sets of cusp forms1996-03-31Paper
Regainingly approximable numbers and setsN/APaper

Research outcomes over time

This page was built for person: P. H. Hertling