Zobrazeno 1 - 10
of 266
pro vyhledávání: '"P. Kawalek"'
Autor:
Gaunkar, Sunanda Prabhu, Fischer, Denise, Rozpędek, Filip, Bhatia, Umang, Verma, Shobhit, Tarhan, Ahit Kaan, Zvi, Uri, Kawalek, Nancy
In this paper, we explain the conceptual development of the STAGE Lab Quantum Casino (a.k.a. the STAGE Lab Quantum Arcade), one of the Lab's most recent artistic endeavors about quantum physics. This work consists of a series of card and digital game
Externí odkaz:
http://arxiv.org/abs/2402.13431
Autor:
Gaunkar, Sunanda Prabhu, Askey, Ellen, Chasman, Meira, Takaira, Koksuke, Smith, Calahan, Murphy, Amanda, Kawalek, Nancy
The complexity of science and its frequent lack of accessibility often creates disinterest among the general public. Furthermore, there exists a gap between the public perception of science and the reality of scientific research, which severely limit
Externí odkaz:
http://arxiv.org/abs/2402.03598
Trust and privacy have emerged as significant concerns in online transactions. Sharing information on health is especially sensitive but it is necessary for purchasing and utilizing health insurance. Evidence shows that consumers are increasingly com
Externí odkaz:
http://arxiv.org/abs/2401.11249
Publikováno v:
IET Intelligent Transport Systems, Vol 18, Iss S1, Pp 2814-2826 (2024)
Abstract Common difficulties across industries are discovered in data management, where handling the volume, variety, and quality of data is crucial for informed decisions in uncertain environments. In this context, rail management must navigate comp
Externí odkaz:
https://doaj.org/article/cf2475ade6924038acf5f5d9bb8d1783
We study how the complexity of modular circuits computing AND depends on the depth of the circuits and the prime factorization of the modulus they use. In particular our construction of subexponential circuits of depth 2 for AND helps us to classify
Externí odkaz:
http://arxiv.org/abs/2106.02947
The study of the complexity of the equation satisfiability problem in finite groups had been initiated by Goldmann and Russell (2002) where they showed that this problem is in polynomial time for nilpotent groups while it is NP-complete for non-solva
Externí odkaz:
http://arxiv.org/abs/2010.11788
In arXiv:1710.08163 a generalization of Boolean circuits to arbitrary finite algebras had been introduced and applied to sketch P versus NP-complete borderline for circuits satisfiability over algebras from congruence modular varieties. However the p
Externí odkaz:
http://arxiv.org/abs/2002.08626
Autor:
Kawałek, Piotr, Krzaczkowski, Jacek
In this paper two algorithms solving circuit satisfiability problem over supernilpotent algebras are presented. The first one is deterministic and is faster than fastest previous algorithm presented by Aichinger. The second one is probabilistic with
Externí odkaz:
http://arxiv.org/abs/2002.08634
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Evgeniy Panin, Aibol Esbolat, Alexandr Arbuz, Dmitry Kuis, Abdrakhman Naizabekov, Sergey Lezhnev, Almas Yerzhanov, Ivan Krupenkin, Andrey Tolkushkin, Anna Kawalek, Pavel Tsyba
Publikováno v:
Modelling and Simulation in Engineering, Vol 2024 (2024)
In this paper, finite element simulation of asymmetric rolling in relief rolls of C11000 copper alloy in order to analyze the effectiveness of possible roll profiles and technological schemes of deformation was performed. The scientific innovation of
Externí odkaz:
https://doaj.org/article/7a42ceff237d435fa1cf8ee9170eba90