◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

P. Manyem

8 papers hereh-index 7234 citations38 works total

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

author position
  • sole author8

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

fields
  • cs.CC4
  • cs.LO2
  • cs.DS1
  • math.OC1

identity via Semantic Scholar / OpenAlex

activity
20062022
most citedDuality Gap, Computational Complexity and NP Completeness: A Survey

3 citations · 3 across the 8 of their papers we have counts for

collaborators
Showing 2009 · cs.CCShow all

1 paper · 2 filters

cs.CC2009

Clique and Vertex Cover are solvable in polynomial time if the input structure is ordered and contains a successor predicate

Prabhu Manyem

In this manuscript, assuming that Graedel's 1991 results are correct (which implies that bounds on the solution values for optimization problems can be expressed in existential sec…

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