Browse "School of Computing(전산학부)" by Subject NUMBERS

Showing results 1 to 6 of 6

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

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

2
Computational Complexity of Quantum Satisfiability

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

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

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

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

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

5
Real hypercomputation and continuity

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

6
Set systems and families of permutations with small traces

Cheong, Otfried; Goaoc, Xavier; Nicaud, Cyril, EUROPEAN JOURNAL OF COMBINATORICS, v.34, no.2, pp.229 - 239, 2013-02

Discover

Type

. next

Open Access

Date issued

. next

Subject

. next

rss_1.0 rss_2.0 atom_1.0