◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

M. Santha

32 papers hereh-index 314.5k citations124 works total

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

author position
  • sole author1
  • middle author16
  • last author15

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

fields
  • quant-ph20
  • cs.CC6
  • cs.DS4
  • cs.GT1
  • math.NT1

identity via Semantic Scholar / OpenAlex

activity
19992025
most citedQuantum walk based search algorithms

24 citations · 57 across the 20 of their papers we have counts for

collaborators
Showing 2016Show all

1 paper · 1 filter

cs.CC2016

On the complexity of probabilistic trials for hidden satisfiability problems

Itai Arad, Adam Bouland, Daniel Grier +3

What is the minimum amount of information and time needed to solve 2SAT? When the instance is known, it can be solved in polynomial time, but is this also possible without knowing…

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