◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

David Witmer

7 papers hereh-index 10491 citations18 works total

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

author position
  • middle author1
  • last author6

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

fields
  • cs.CC4
  • cs.DS2
  • cs.IT1

identity via Semantic Scholar / OpenAlex

activity
20122017
most citedSparsest Cut on Bounded Treewidth Graphs: Algorithms and Hardness Results

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

collaborators
Showing 2017Show all

1 paper · 1 filter

cs.CC2017★ 11 cited

Sum of squares lower bounds for refuting any CSP

Pravesh K. Kothari, Ryuhei Mori, Ryan O'Donnell +1

Let P:{0,1}k→{0,1} be a nontrivial k-ary predicate. Consider a random instance of the constraint satisfaction problem CSP(P) on n variables with Δn cons…

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