◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

C. Durr

1 paper hereh-index 350 citations5 works total

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

author position
  • first author1

Across the 1 of 1 paper where every author was matched, so the position is known.

fields
  • quant-ph1

identity via Semantic Scholar / OpenAlex

most citedQuantum query complexity of graph connectivity

7 citations · 7 across the 1 of their papers we have counts for

collaborators
Showing quant-phShow all

1 paper · 1 filter

quant-ph2003★ 7 cited

Quantum query complexity of graph connectivity

Christoph Durr, Mehdi Mhalla, Yaohui Lei

Harry Buhrman et al gave an Omega(sqrt n) lower bound for monotone graph properties in the adjacency matrix query model. Their proof is based on the polynomial method. However for…

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