P. Hertling

发表

Continuity and Computability of Relations

V. Brattka, P. Hertling, 1994 .

Cdmtcs Research Report Series Randomness Spaces Randomness Spaces

K. Weihrauch, P. Hertling, 2022 .

A Real Number Structure that is Effectively Categorical

Peter Hertling, P. Hertling, 1997, Math. Log. Q..

Computability and complexity in analysis : 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000 : selected papers

Jens Blanck, Peter Hertling, Vasco Brattka, 2001 .

Series Randomness on Full Shift Spaces

Cristian S. Calude, K. Weihrauch, P. Hertling, 1999 .

On the Solvability of Ill-Posed Problems in two Models of Computation

Peter Hertling, P. Hertling, 2022 .

Topological Complexityof Zero Findingwith Algebraic Operations

P. Hertling, 2002 .

Small spanning sets of cusp forms

P. Hertling, 1995 .

A Real Number Structure that is Effectively Categorical

P. Hertling, 1997, Math. Log. Q..

A Tutorial on Computable Analysis

Klaus Weihrauch, Peter Hertling, Vasco Brattka, 2008 .

A lower bound for range enclosure in interval arithmetic

Peter Hertling, P. Hertling, 2002, Theor. Comput. Sci..

EXPSPACE-Completeness of the Logics K4 × S5 and S4 × S5 and the Logic of Subset Spaces

P. Hertling, Gisela Krommes, 2021, ACM Trans. Comput. Log..

A Polynomial Time Algorithm for Computing Lanford ’ s solution of Feigenbaum ’ s Functional Equation Lanford

Peter Hertling, Christoph Spandl, P. Hertling, 2014 .

Task curve planning for painting robots. I. Process modeling and calibration

Henrik Gordon Petersen, Rune Larsen, Peter Hertling, 1996, IEEE Trans. Robotics Autom..

A Banach-Mazur computable but not Markov computable function on the computable real numbers

Peter Hertling, P. Hertling, 2002, Ann. Pure Appl. Log..

Worst Cases for the Exponential Function in the IEEE 754r decimal64 Format

C. Hoffmann, N. Revol, P. Hertling, 2019 .

Simply Normal Numbers to Different Bases

Peter Hertling, P. Hertling, 2002, J. Univers. Comput. Sci..

Two Counterexamples Concerning the Scott Topology on a Partial Order pdf

Peter Hertling, P. Hertling, 2016, ArXiv.

Topological properties of real number representations

Peter Hertling, Vasco Brattka, V. Brattka, 2002, Theor. Comput. Sci..

On the Computational Complexity of the Range Computation Problem

P. Hertling, 2020 .

Random elements in effective topological spaces with measure

Klaus Weihrauch, Peter Hertling, K. Weihrauch, 2003, Inf. Comput..

Levels of Degeneracy and Exact Lower Complexity Bounds for Geometric Algorithms

Klaus Weihrauch, Peter Hertling, K. Weihrauch, 1994, CCCG.

Topological Complexity with Continuous Operations

Peter Hertling, P. Hertling, 1996, J. Complex..

Feasible Real Random Access Machines

Peter Hertling, Vasco Brattka, V. Brattka, 1996, J. Complex..

Banach-Mazur Computable Functions on Metric Spaces

Peter Hertling, P. Hertling, 2000, CCA.

Computability and complexity in analysis : 4th International Workshop, CCA 2000, Swansea, UK, September 17-19, 2000 : selected papers

Cca, V. Brattka, P. Hertling, 2001 .

Effective subsets under homeomorphisms of Rn

Volker Bosserhoff, Peter Hertling, P. Hertling, 2015, Inf. Comput..

Computing a Solution of Feigenbaum's Functional Equation in Polynomial Time

P. Hertling, C. Spandl, 2014, Log. Methods Comput. Sci..

Clarke's generalized gradient and Edalat's L-derivative

Peter Hertling, P. Hertling, 2017, J. Log. Anal..

Nearly Computable Real Numbers

P. Hertling, Philip Janicki, 2023, Comput..