<b>P Equals NP: A Core-Based Smart Sampling Framework</b>
<p dir="ltr">Let</p><ul><li>Σ\Sigma be a finite alphabet.</li><li>Σ∗\Sigma^* the set of all finite strings over Σ\Sigma.</li><li>L⊆Σ∗L \subseteq \Sigma^* be a decision problem.</li></ul><p dir="ltr">We define the s...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| منشور في: |
2025
|
| الموضوعات: | |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1852017144786583552 |
|---|---|
| author | DURGHAM QARALLEH (21904172) |
| author_facet | DURGHAM QARALLEH (21904172) |
| author_role | author |
| dc.creator.none.fl_str_mv | DURGHAM QARALLEH (21904172) |
| dc.date.none.fl_str_mv | 2025-08-31T15:57:05Z |
| dc.identifier.none.fl_str_mv | 10.6084/m9.figshare.30019318.v1 |
| dc.relation.none.fl_str_mv | https://figshare.com/articles/dataset/_b_P_Equals_NP_A_Core-Based_Smart_Sampling_Framework_b_/30019318 |
| dc.rights.none.fl_str_mv | CC BY 4.0 info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Mathematical logic, set theory, lattices and universal algebra theory alone |
| dc.title.none.fl_str_mv | <b>P Equals NP: A Core-Based Smart Sampling Framework</b> |
| dc.type.none.fl_str_mv | Dataset info:eu-repo/semantics/publishedVersion dataset |
| description | <p dir="ltr">Let</p><ul><li>Σ\Sigma be a finite alphabet.</li><li>Σ∗\Sigma^* the set of all finite strings over Σ\Sigma.</li><li>L⊆Σ∗L \subseteq \Sigma^* be a decision problem.</li></ul><p dir="ltr">We define the standard complexity classes</p> |
| eu_rights_str_mv | openAccess |
| id | Manara_7ff03025b215109ed78b2da3f4e2a5dc |
| identifier_str_mv | 10.6084/m9.figshare.30019318.v1 |
| network_acronym_str | Manara |
| network_name_str | ManaraRepo |
| oai_identifier_str | oai:figshare.com:article/30019318 |
| publishDate | 2025 |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| rights_invalid_str_mv | CC BY 4.0 |
| spelling | <b>P Equals NP: A Core-Based Smart Sampling Framework</b>DURGHAM QARALLEH (21904172)Mathematical logic, set theory, lattices and universal algebratheory alone<p dir="ltr">Let</p><ul><li>Σ\Sigma be a finite alphabet.</li><li>Σ∗\Sigma^* the set of all finite strings over Σ\Sigma.</li><li>L⊆Σ∗L \subseteq \Sigma^* be a decision problem.</li></ul><p dir="ltr">We define the standard complexity classes</p>2025-08-31T15:57:05ZDatasetinfo:eu-repo/semantics/publishedVersiondataset10.6084/m9.figshare.30019318.v1https://figshare.com/articles/dataset/_b_P_Equals_NP_A_Core-Based_Smart_Sampling_Framework_b_/30019318CC BY 4.0info:eu-repo/semantics/openAccessoai:figshare.com:article/300193182025-08-31T15:57:05Z |
| spellingShingle | <b>P Equals NP: A Core-Based Smart Sampling Framework</b> DURGHAM QARALLEH (21904172) Mathematical logic, set theory, lattices and universal algebra theory alone |
| status_str | publishedVersion |
| title | <b>P Equals NP: A Core-Based Smart Sampling Framework</b> |
| title_full | <b>P Equals NP: A Core-Based Smart Sampling Framework</b> |
| title_fullStr | <b>P Equals NP: A Core-Based Smart Sampling Framework</b> |
| title_full_unstemmed | <b>P Equals NP: A Core-Based Smart Sampling Framework</b> |
| title_short | <b>P Equals NP: A Core-Based Smart Sampling Framework</b> |
| title_sort | <b>P Equals NP: A Core-Based Smart Sampling Framework</b> |
| topic | Mathematical logic, set theory, lattices and universal algebra theory alone |