Weakly complete problems are not rare | Zendy

David Juedes | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Weakly complete problems are not rare

Author(s) -

David Juedes

Publication year - 1995

Publication title -

computational complexity

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.973

H-Index - 39

eISSN - 1420-8954

pISSN - 1016-3328

DOI - 10.1007/bf01206322

Subject(s) - mathematics , decidability , intuition , discrete mathematics , argument (complex analysis) , calculus (dental) , combinatorics , philosophy , epistemology , medicine , biochemistry , chemistry , dentistry

Certain natural decision problems are known to be intractable because they are complete forE, the class of all problems decidable in exponential time. Lutz recently conjectured that manyother seemingly intractable problems are not complete for E, but are intractable nonethelessbecause they are weakly complete for E. The main result of this paper shows that Lutz's intuitionis at least partially correct; many more problems are weakly complete for E than are completefor E.The main result of ...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research