Skip to main content

All Questions

Tagged with
Filter by
Sorted by
Tagged with
14 votes
0 answers
475 views

Is there a P-complete language X such that succinct-X is in P?

I came across a paper called "A Note on Succinct Representation of Graphs". It seems that in the discussion section they claim that for any problem $X$ that is $\mathrm{P}$-hard under projections, $\...
Michael Wehar's user avatar