Researcher Page

사진

Ziegler, Martin A. (마틴 지글러) I-3331-2015 0000-0001-6734-7875

Department
School of Computing(전산학부)
Website
http://m.zie.deHomePage
Research Area
Complexity and Real Computation

Keyword Cloud

Reload 더보기
1

Definable relations in finite dimensional subspace lattices with involution. Part II: Quantifier-free and homogeneous descriptions

Herrmann, Christian; Ziegler, Martinresearcher, ALGEBRA UNIVERSALIS, v.80, no.28, 2019-09

2

Definable relations in finite-dimensional subspace lattices with involution

Herrmann, Christian; 마틴 지글러researcher, ALGEBRA UNIVERSALIS, v.79, no.3, 2018-09

3

On the computational complexity of the Dirichlet Problem for Poisson's Equation

Kawamura, Akitoshi; Steinberg, Florian; Ziegler, Martin A.researcher, MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, v.27, no.8, pp.1437 - 1465, 2017-12

4

Preface to the special issue: Continuity, Computability, Constructivity: From Logic to Algorithms 2014

Bauer, Andrej; Berger, Ulrich; Fouche, Willem; et al, JOURNAL OF LOGIC AND ANALYSIS, v.9, 2017-04

5

On the consistency problem for modular lattices and related structures

Herrmann, Christian; Tsukamoto, Yasuyuki; Ziegler, Martinresearcher, INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION, v.26, no.8, pp.1573 - 1595, 2016-12

6

Computational Complexity of Quantum Satisfiability

Herrmann, Christian; Ziegler, Martin A.researcher, JOURNAL OF THE ACM, v.63, no.2, 2016-05

7

Computational benefit of smoothness: Parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy

Kawamura, Akitoshi; Mueller, Norbert; Roesnick, Carsten; et al, JOURNAL OF COMPLEXITY, v.31, no.5, pp.689 - 714, 2015-10

8

COMPUTATIONAL COMPLEXITY OF SMOOTH DIFFERENTIAL EQUATIONS

Kawamura, Akitoshi; Ota, Hiroyuki; Roesnick, Carsten; et al, LOGICAL METHODS IN COMPUTER SCIENCE, v.10, no.1, 2014

9

Relative computability and uniform continuity of relations

Pauly, Arno; Ziegler, Martin A.researcher, Journal of Logic and Analysis, v.5, no.7, pp.1 - 39, 2013

10

Real computation with least discrete advice: A complexity theory of nonuniform computability with applications to effective linear algebra

Ziegler, Martinresearcher, ANNALS OF PURE AND APPLIED LOGIC, v.163, no.8, pp.1108 - 1139, 2012-08

11

REAL ANALYTIC MACHINES AND DEGREES: A TOPOLOGICAL VIEW ON ALGEBRAIC LIMITING COMPUTATION

Gaertner, Tobias; Ziegler, Martinresearcher, LOGICAL METHODS IN COMPUTER SCIENCE, v.7, no.3, 2011

12

Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation

Meer, Klaus; Ziegler, Martinresearcher, FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, v.9, no.5, pp.599 - 609, 2009-10

13

Physically-relativized Church-Turing Hypotheses: Physical foundations of computing and complexity theory of computational physics

Ziegler, Martinresearcher, APPLIED MATHEMATICS AND COMPUTATION, v.215, no.4, pp.1431 - 1447, 2009-10

14

On the coverings of the d-cube for d <= 6

Emamy-K, M. R.; Ziegler, M.researcher, DISCRETE APPLIED MATHEMATICS, v.156, no.17, pp.3156 - 3165, 2008-10

15

An explicit solution to Post's Problem over the reals

Meer, Klaus; Ziegler, Martinresearcher, JOURNAL OF COMPLEXITY, v.24, no.1, pp.3 - 15, 2008-02

16

Singular coverings and non-uniform notions of closed set computability

Le Roux, Stephane; Ziegler, Martinresearcher, MATHEMATICAL LOGIC QUARTERLY, v.54, no.5, pp.545 - 560, 2008

17

Real hypercomputation and continuity

Ziegler, Martinresearcher, THEORY OF COMPUTING SYSTEMS, v.41, no.1, pp.177 - 206, 2007-07

18

Geometric spanners with applications in wireless networks

Schindelhauer, Christian; Volbert, Klaus; Ziegler, Martinresearcher, COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.36, no.3, pp.197 - 214, 2007-04

19

Effectively open real functions

Ziegler, Martinresearcher, JOURNAL OF COMPLEXITY, v.22, no.6, pp.827 - 849, 2006-12

20

Stability versus speed in a computable algebraic model

Ziegler, Mresearcher, THEORETICAL COMPUTER SCIENCE, v.351, no.1, pp.14 - 26, 2006-02

Load more items
Loading...

rss_1.0 rss_2.0 atom_1.0