Jump to content

Existing user? Sign In
Sign In

Remember me Not recommended on shared computers

Forgot your password?

Or sign in with one of these services
Sign Up

Browse
- Forums
- Events
- Guidelines
- Staff
- Online Users
- Leaderboard
- More
Activity
- All Activity
- Search
- More
Leaderboard
More
- More

Home

Secret_Very_Secret

New Members

View Profile See their activity

Posts
1
Joined
October 4, 2019
Last visited
October 10, 2019

Content Type

All Activity

Profiles

Forums

Topics
Posts

Events

Everything 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?

Secret_Very_Secret posted a topic in Computer Science

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
- October 4, 2019
- 1 reply

×

Browse
- Back
- Forums
- Events
- Guidelines
- Staff
- Online Users
- Leaderboard
Activity
- Back
- All Activity
- Search
Leaderboard

×

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.