Jump to content

Secret_Very_Secret

New Members
 View Profile  See their activity

  • Posts

    1

  • Joined

  • Last visited

 Content Type 

Posts posted by Secret_Very_Secret

    If there's a proof that creating tallies or any sparse language in poly-time is impossible, then what's the significance of this decision problem?

    in Computer Science

    Posted

    Is there a legit proof that creating tallies or any other sparse language in poly-time is impossible?

    Or is this just a conjecture widely believed?

     

    Please read the picture below before going to the links.

    I have a paste-bin for an algorithm that solves my decision problem. https://pastebin.com/kuj2sZys

    I have a repl link as well. https://repl.it/repls/WiryGrandioseSearch

     

     

     

    image.thumb.png.ead3cc67c489fcb974993d702b5dc092.png

     

    0
×
×
  • Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.