◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

S. Verma

1 paper hereh-index 13 citations3 works total

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

author position
  • last author1

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

fields
  • cs.CC1
same name
  • S. Verma — 1 paper, h 3
  • S. Verma — 1 paper, h 15
  • S. Verma — 1 paper

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

most citedA direct reduction of PPAD Lemke-verified linear complementarity problems to bimatrix games

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

collaborators

1 paper

cs.CC2013★ 2 cited

A direct reduction of PPAD Lemke-verified linear complementarity problems to bimatrix games

Ilan Adler, Sushil Verma

The linear complementarity problem, LCP(q,M), is defined as follows. For given M,q find z such that q+Mz>=0, z>=0, z(q + M z)=0,or certify that there is no such z. It is well known…

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