◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Young-Kun Ko

2 papers hereh-index 00 citations0 works total

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

author position
  • first author2

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

fields
  • cs.CC1
  • cs.DS1

identity via Semantic Scholar / OpenAlex

collaborators
Showing cs.CCShow all

1 paper · 1 filter

cs.CC2020

Hardness of Approximate Nearest Neighbor Search under L-infinity

Young Kun Ko, Min Jae Song

We show conditional hardness of Approximate Nearest Neighbor Search (ANN) under the ℓ∞​ norm with two simple reductions. Our first reduction shows that hardness of a spec…

◍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.