-
1دورية أكاديمية
المؤلفون: Konstantinos E. Kyritsis
المساهمون: Kyritsis E. Konstantinos
مصطلحات موضوعية: Polynomial time complexity, EXPTIME complexity, Millennium mathematical problems, COMPUTER SCIENCE
العلاقة: https://olympias.lib.uoi.gr/jspui/handle/123456789/33111Test; http://dx.doi.org/10.26268/heal.uoi.12882Test; Journal of Computer and Communications Vol.11 August 2023(8):181-194
الإتاحة: https://doi.org/10.26268/heal.uoi.12882Test
https://olympias.lib.uoi.gr/jspui/handle/123456789/33111Test -
2دورية أكاديمية
المؤلفون: Kyritsis, Konstantinos, E
المساهمون: University of Ioannina
المصدر: ISSN: 2327-5219.
مصطلحات موضوعية: Polynomial time complexity, NP-complexity, EXPTIME complexity, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
العلاقة: hal-04192246; https://hal.science/hal-04192246Test; https://hal.science/hal-04192246v2/documentTest; https://hal.science/hal-04192246v2/file/jcc_2023083017035205_uplodaed_correct.pdfTest
الإتاحة: https://doi.org/10.4236/jcc.2023.118013Test
https://hal.science/hal-04192246Test
https://hal.science/hal-04192246v2/documentTest
https://hal.science/hal-04192246v2/file/jcc_2023083017035205_uplodaed_correct.pdfTest -
3تقرير
المؤلفون: Kyritsis, Constantine, Konstantinos
المساهمون: University of Ioannina
المصدر: https://hal.science/hal-03601593Test ; 2023.
مصطلحات موضوعية: 3 rd Clay Millennium problem, EXPTIME-complete problems, NPcomplexity, P-complexity Mathematical Subject Classification: 68Q15, [INFO]Computer Science [cs]
العلاقة: hal-03601593; https://hal.science/hal-03601593Test; https://hal.science/hal-03601593v3/documentTest; https://hal.science/hal-03601593v3/file/Jcc_TYPED_29_08_23_word_corrected_suplemented_with_enigma_3rs-soluton_10_10_23.pdfTest
-
4تقرير
المؤلفون: Kyritsis, Konstantinos E.
مصطلحات موضوعية: 3rd Clay Millennium problem, EXPTIME-complete problems, NP-complexity, P-complexity, Coumputer science
العلاقة: https://olympias.lib.uoi.gr/jspui/handle/123456789/31616Test; http://dx.doi.org/10.26268/heal.uoi.11432Test
الإتاحة: https://doi.org/10.26268/heal.uoi.11432Test
https://olympias.lib.uoi.gr/jspui/handle/123456789/31616Test -
5تقرير
المؤلفون: Kyritsis, Konstantinos E.
مصطلحات موضوعية: 3rd Clay Millennium problem P vs NP, NP-complexity, EXPTIME-complete problems, P-complexity, Computer science
العلاقة: https://olympias.lib.uoi.gr/jspui/handle/123456789/31701Test; http://dx.doi.org/10.26268/heal.uoi.11517Test
الإتاحة: https://doi.org/10.26268/heal.uoi.11517Test
https://olympias.lib.uoi.gr/jspui/handle/123456789/31701Test -
6تقرير
المؤلفون: KYRITSIS, CONSTANTINE
المساهمون: University of Ioannina
المصدر: https://hal.archives-ouvertes.fr/hal-03601593Test ; 2022.
مصطلحات موضوعية: NPcomplexity, P-complexity Mathematical Subject Classification: 68Q15, 3 rd Clay Millennium problem, EXPTIME-complete problems, [INFO]Computer Science [cs]
العلاقة: hal-03601593; https://hal.archives-ouvertes.fr/hal-03601593Test; https://hal.archives-ouvertes.fr/hal-03601593/documentTest; https://hal.archives-ouvertes.fr/hal-03601593/file/The%20very_short%20_but_true_solution_of_the%20P_vs_NP_problem_31_01_22.pdfTest
-
7دورية أكاديمية
المؤلفون: Konstantinos E. Kyritsis
المساهمون: Kyritsis Konstantinos E.
مصطلحات موضوعية: Polynomial time complexity, EXPTIME complexity, Millennium mathematical problems, COMPUTER SCIENCE
العلاقة: https://olympias.lib.uoi.gr/jspui/handle/123456789/33110Test; http://dx.doi.org/10.26268/heal.uoi.12881Test; World Journal of Research and Review 13(3):21-26
الإتاحة: https://doi.org/10.26268/heal.uoi.12881Test
https://olympias.lib.uoi.gr/jspui/handle/123456789/33110Test -
8دورية أكاديمية
المؤلفون: Fumitaka Ito, Masahiko Naito, Naoyuki Katabami, Tatsuie Tsukiji
المصدر: Algorithms, Vol 14, Iss 3, p 70 (2021)
مصطلحات موضوعية: computational complexity, custodial capture, EXPTIME hard, generalized game, repetition, Industrial engineering. Management engineering, T55.4-60.8, Electronic computers. Computer science, QA75.5-76.95
العلاقة: https://www.mdpi.com/1999-4893/14/3/70Test; https://doaj.org/toc/1999-4893Test; https://doaj.org/article/e8c4838a5525469d88d48a52af8125edTest
الإتاحة: https://doi.org/10.3390/a14030070Test
https://doaj.org/article/e8c4838a5525469d88d48a52af8125edTest -
9دورية أكاديمية
المؤلفون: Kyritsis, Constantine, Konstantinos
المساهمون: University of Ioannina
المصدر: ISSN: 2455-3956 ; WORLD JOURNAL OF RESEARCH AND REVIEW ; https://hal.science/hal-03360609Test ; WORLD JOURNAL OF RESEARCH AND REVIEW, 2021, 13 (3), pp.21-26. ⟨10.31871/WJRR.13.3.8⟩ ; www.wjrr.org.
مصطلحات موضوعية: 3rd Clay Millennium problem, EXPTIME-complete problems, NP-complexity, P-complexity Mathematical Subject Classification: 68Q15, [INFO]Computer Science [cs]
العلاقة: hal-03360609; https://hal.science/hal-03360609Test; https://hal.science/hal-03360609v3/documentTest; https://hal.science/hal-03360609v3/file/1st_SOLUTIOIN_WITH_ENIGMA_TURING_MACHINE_review_10_10_23.pdfTest
الإتاحة: https://doi.org/10.31871/WJRR.13.3.8Test
https://hal.science/hal-03360609Test
https://hal.science/hal-03360609v3/documentTest
https://hal.science/hal-03360609v3/file/1st_SOLUTIOIN_WITH_ENIGMA_TURING_MACHINE_review_10_10_23.pdfTest -
10
المساهمون: Laboratoire d'Informatique, de Modélisation et d'Optimisation des Systèmes (LIMOS), Ecole Nationale Supérieure des Mines de St Etienne-Université Clermont Auvergne [2017-2020] (UCA [2017-2020])-Centre National de la Recherche Scientifique (CNRS), Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes (LIMOS), SIGMA Clermont (SIGMA Clermont)-Université d'Auvergne - Clermont-Ferrand I (UdA)-Ecole Nationale Supérieure des Mines de St Etienne-Centre National de la Recherche Scientifique (CNRS)-Université Blaise Pascal - Clermont-Ferrand 2 (UBP), Laboratoire d'Algorithmique Complexité et Logique (LACL), Université Paris-Est Créteil Val-de-Marne - Paris 12 (UPEC UP12), Equipe AMACC - Laboratoire GREYC - UMR6072, Groupe de Recherche en Informatique, Image et Instrumentation de Caen (GREYC), Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Ingénieurs de Caen (ENSICAEN), Normandie Université (NU)-Normandie Université (NU)-Université de Caen Normandie (UNICAEN), Normandie Université (NU)-Centre National de la Recherche Scientifique (CNRS)-École Nationale Supérieure d'Ingénieurs de Caen (ENSICAEN), Normandie Université (NU), Ecole Nationale Supérieure des Mines de St Etienne (ENSM ST-ETIENNE)-Centre National de la Recherche Scientifique (CNRS)-Université Clermont Auvergne (UCA)-Institut national polytechnique Clermont Auvergne (INP Clermont Auvergne), Université Clermont Auvergne (UCA)-Université Clermont Auvergne (UCA), Université de Caen Normandie (UNICAEN), Normandie Université (NU)-Normandie Université (NU)-École Nationale Supérieure d'Ingénieurs de Caen (ENSICAEN), Normandie Université (NU)-Centre National de la Recherche Scientifique (CNRS)-Université de Caen Normandie (UNICAEN), Normandie Université (NU)-Centre National de la Recherche Scientifique (CNRS), IFCAM project 'Applications of graph homomorphisms' (MA/IFCAM/18/39)., ANR-17-CE40-0022,HOSIGRA,Homomorphismes de graphes signés(2017), ANR-16-IDEX-0001,CAP 20-25,CAP 20-25(2016), Université Blaise Pascal - Clermont-Ferrand 2 (UBP)-Université d'Auvergne - Clermont-Ferrand I (UdA)-SIGMA Clermont (SIGMA Clermont)-Ecole Nationale Supérieure des Mines de St Etienne-Centre National de la Recherche Scientifique (CNRS)
المصدر: Conference on Computability in Europe (CiE 2019)
Conference on Computability in Europe (CiE 2019), Jul 2019, Durham, United Kingdom. pp.108-119, ⟨10.1007/978-3-030-22996-2_10⟩
Computing with Foresight and Industry ISBN: 9783030229955
CiEمصطلحات موضوعية: FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Discrete Mathematics (cs.DM), computer.internet_protocol, Computer science, Formal Languages and Automata Theory (cs.FL), EXPTIME, Computer Science - Formal Languages and Automata Theory, 0102 computer and information sciences, computer.software_genre, 01 natural sciences, Combinatorics, Computer Science - Databases, Regular expression, 0101 mathematics, Computer Science::Databases, ComputingMilieux_MISCELLANEOUS, XPath, Graph database, [INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB], 010102 general mathematics, InformationSystems_DATABASEMANAGEMENT, [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO], Digraph, Databases (cs.DB), Logic in Computer Science (cs.LO), TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, 010201 computation theory & mathematics, Path (graph theory), Regular graph, Homomorphism, computer, Computer Science::Formal Languages and Automata Theory, Computer Science - Discrete Mathematics
الوصول الحر: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e6d640753a0051d19cbca2db0a68839eTest
http://arxiv.org/abs/2305.07271Test