Jump to content

Secret_Very_Secret

New Members
  • Content Count

    1
  • Joined

  • Last visited

Community Reputation

0 Neutral

About Secret_Very_Secret

  • Rank
    Lepton
  1. 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
×
×
  • 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.