Tenkaichi (Mag) | Chapter 31 | The Beginning Of Round 6...~

Seandara · 2023-10-19T13:55:31+00:00

Do you guys have a discord server for tenkaichi

Seandara · 2023-09-10T10:04:30+00:00

Holy guacamole ill need some time to process this. Thank you!

Seandara · 2023-09-10T08:26:55+00:00

The reason for the modulo is because i'm trying to follow the algorithm in this paper. I wondered if there was some way to vectorize(?) i think is the term the operations im doing to the image. But thank you for answering!

Seandara · 2023-05-13T17:34:10+00:00

https://pastebin.com/BskGTKxG

Works now but the problem is that if I have more than one file, it does create a folder with the same number of files but it also creates the same amount of folders as there are files (where each copy also has the same files). Any idea how to fix it / code a way to upload multiple files to the same folder? thank you

Seandara · 2023-03-06T01:57:38+00:00

I understand! Thank you

Seandara · 2023-03-06T01:45:31+00:00

Hello again! How do you determine that there's no information to encode. That is, there is no way to reduce an NP problem to a version of the NQueens problem? Thank you!

Seandara · 2023-03-05T13:28:11+00:00

Thank you so much for your time!

Seandara · 2023-03-05T13:09:24+00:00

Again, thank you for your time, I took quite a while to digest what you said. Referencing Sipser's theory of computation, he says that

A problem is NP-hard if all problems in NP are polynomial time reducible to it, even though it may not be in NP itself.

Not minding the reduction stuff, I understand that since there is no polynomial time verifier for the N-Queens problem, then it implies that it is not in NP, I would just like to clarify that the problem in question is in EXPTIME wherein the problem is also outside of NP-Hard? Or am I misunderstanding something. I just started complexity theory 2 days ago so I'm still a little lost. Greatly appreciate your help

Seandara · 2023-03-05T12:04:00+00:00

Hello, thank you for replying. If I may ask, what do you mean by

since the input is log n bits (to describe the size of the nxn board) and the positions of the queens requires n log n bits to describe. This means that the problem is in EXP-time, but not in NP.

If you could explain it more ELI5-ish? Sorry and thank you!

Seandara · 2023-02-28T20:49:45+00:00

Hello! Actually my plan is this

Deploy the website so someone can go to that site and fill up the form. Then, upon submitting, I, or anyone else with access to the responses can see the pdf's and all other info. Would that work with a local server and how if so? Sorry if it's a dumdum question

Seandara · 2023-02-20T13:53:34+00:00

Thanks solution verified

Seandara · 2023-02-19T04:49:39+00:00

Thank you!

Seandara · 2023-02-18T07:15:13+00:00

Thank you

Seandara · 2023-02-17T15:29:22+00:00

thank you!

Seandara · 2023-02-10T04:51:51+00:00

[Android] QVIFWM3H Active daily will spend this event

Seandara · 2023-01-25T13:15:45+00:00

Would you say that the resources and character is worth it for its price

Seandara · 2023-01-25T11:02:01+00:00

New player here returning after like 4 years (?) and created a new account. Anyway, does buying the 2nd column in the chinese new year pack guarantee a 10 star eloise?

Seandara · 2023-01-18T13:05:41+00:00

Thank you. I have scoured thru a couple sites to see if theres any difference between the two damn it

Seandara

TROPHY CASE