Dominant Strategies of Quantum Games on Quantum Periodic Automata

Autor: Konstantinos Giannakis, Christos Papalitsas, Kalliopi Kastampolidou, Alexandros Singh, Theodore Andronikos

Publikováno v: Computation, Vol 3, Iss 4, Pp 586-599 (2015)

Game theory and its quantum extension apply in numerous fields that affect people’s social, political, and economical life. Physical limits imposed by the current technology used in computing architectures (e.g., circuit size) give rise to the need

Externí odkaz: https://doaj.org/article/68be38b064c641ae9580d42b086ef20b

Minor obstructions for apex-pseudoforests

Autor: Alexandros Singh, Giannos Stamoulis, Alexandros Leivaditis, Dimitrios M. Thilikos, Konstantinos Tsatsanis

Publikováno v: Discrete Mathematics
Discrete Mathematics, Elsevier, 2021, 344 (10), pp.112529. ⟨10.1016/j.disc.2021.112529⟩

International audience; A graph is called a pseudoforest if none of its connected components contains more than one cycle. A graph is an apex-pseudoforest if it can become a pseudoforest by removing one of its vertices. We identify 33 graphs that for

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4c099727d59b857239d1247e37ee79af
https://hal.archives-ouvertes.fr/hal-03327317

Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics

Autor: Alexandros Singh, Antoine Genitrini, Olivier Bodini, Mehdi Naima

Publikováno v: Computer Science – Theory and Applications ISBN: 9783030500252
CSR
Computer Science-Theory and Applications-15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 – July 3, 2020, Proceedings
Computer Science – Theory and Applications
15th International Computer Science Symposium
15th International Computer Science Symposium, Jun 2020, Yekaterinburg, Russia. pp.155-168, ⟨10.1007/978-3-030-50026-9_11⟩

International audience; There exists a wealth of literature concerning families of increasing trees, particularly suitable for representing the evolution of either data structures in computer science, or probabilistic urns in mathematics, but are als

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::348c34047c1e5810c6d4328044527c7a
https://doi.org/10.1007/978-3-030-50026-9_11

Dominant Strategies of Quantum Games on Quantum Periodic Automata

Autor: Theodore Andronikos, Kalliopi Kastampolidou, Alexandros Singh, Konstantinos Giannakis, Christos Papalitsas

Publikováno v: Computation, Vol 3, Iss 4, Pp 586-599 (2015)
Computation
Volume 3
Issue 4
Pages 586-599

Game theory and its quantum extension apply in numerous fields that affect people’s social, political, and economical life. Physical limits imposed by the current technology used in computing architectures (e.g., circuit size) give rise to the need

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ce16f8583be6b39442193d1f6b0209ff
https://doi.org/10.3390/computation3040586

Methods and Patterns for User-Friendly Quantum Programming

Autor: Alexandros, Singh, Konstantinos, Giannakis, Kalliopi, Kastampolidou, Christos, Papalitsas

Publikováno v: Advances in experimental medicine and biology. 989

The power and efficiency of particular quantum algorithms over classical ones has been proved. The rise of quantum computing and algorithms has highlighted the need for appropriate programming means and tools. Here, we present a brief overview of som

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=pmid________::1078bfb2387a311997ccfec93fd14f04
https://pubmed.ncbi.nlm.nih.gov/28971428