◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Tillmann Miltzow

52 papers hereh-index 201k citations88 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author4
  • first author4
  • middle author21
  • last author23

Across the 52 of 52 papers where every author was matched, so the position is known.

fields
  • cs.CG29
  • cs.CC16
  • cs.DM3
  • math.CO3
  • cs.LO1

identity via Semantic Scholar / OpenAlex

activity
20112026
most citedTraining Neural Networks is ∃R-complete

11 citations · 119 across the 41 of their papers we have counts for

collaborators
Showing 2017Show all

3 papers · 1 filter

cs.CG2017★ 1 cited

Completeness for the Complexity Class ∀∃R and Area-Universality

Michael G. Dobbins, Linda Kleist, Tillmann Miltzow +1

Exhibiting a deep connection between purely geometric problems and real algebra, the complexity class ∃R plays a crucial role in the study of geometric problems.…

cs.CG2017★ 8 cited

The Art Gallery Problem is ∃R-complete

Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow

We prove that the art gallery problem is equivalent under polynomial time reductions to deciding whether a system of polynomial equations over the real numbers has a solution. The…

cs.CG2017★ 7 cited

Irrational Guards are Sometimes Needed

Mikkel Abrahamsen, Anna Adamaszek, Tillmann Miltzow

In this paper we study the art gallery problem, which is one of the fundamental problems in computational geometry. The objective is to place a minimum number of guards inside a si…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.