◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Maksim Sevelev

1 paper hereh-index 2217 citations2 works total

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

author position
  • middle author1

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

fields
  • cond-mat.dis-nn1

identity via Semantic Scholar / OpenAlex

most citedUniversality of the SAT-UNSAT (jamming) threshold in non-convex continuous constraint satisfaction problems

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

collaborators

1 paper

cond-mat.dis-nn2017★ 128 cited

Universality of the SAT-UNSAT (jamming) threshold in non-convex continuous constraint satisfaction problems

Silvio Franz, Giorgio Parisi, Maksim Sevelev +2

Random constraint satisfaction problems (CSP) have been studied extensively using statistical physics techniques. They provide a benchmark to study average case scenarios instead o…

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