default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 999
Volume 999, 2024
- Prashant Batra
, Vikram Sharma:
Complexity of a root clustering algorithm for holomorphic functions. 114504 - François Doré, Enrico Formenti, Antonio E. Porreca, Sara Riva:
Decomposition and factorisation of transients in functional graphs. 114514 - Xiaojin Zhang:
Corrigendum to "Improved Algorithm for Permutation Testing" [Theoretical Computer Science 986 (2024) 114316]. 114536 - Henning Fernau, Lakshmanan Kuppusamy, Indhumathi Raman:
On the computational completeness of generalized forbidding matrix grammars. 114539 - Yansong Feng, Abderrahmane Nitaj, Yanbin Pan:
Partial prime factor exposure attacks on some RSA variants. 114549 - Szilárd Zsolt Fazekas, Naoya Iwano, Yu Kihara, Ryuichi Matsuoka, Shinnosuke Seki, Hinano Takeuchi:
Towards composable computations by RNA co-transcriptional folding: A proof-of-concept demonstration of nested loops in oritatami. 114550 - Guanzhong Li, Lvzhou Li:
Optimal deterministic quantum algorithm for the promised element distinctness problem. 114551 - Hao Lin, Mingqiang Wang, Jincheng Zhuang, Yang Wang:
Hardness of Entropic Module-LWE. 114553
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-01-10 18:36 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
