Algorithmic Complexity Underpins When Path Information Improves Graph Neural Networks Performance on Molecular Graphs

Συγγραφείς: Ibraheem, A, Author, Kiani, N, Author, Tegner, J, Author

Συνεισφορές: Ibraheem, A, Author, Kiani, N, Author, Tegner, J, Author

Πηγή: LECTURE NOTES IN COMPUTER SCIENCE. 16767:18-34

Σύνδεσμος πρόσβασης: https://ki.se/en/research/search-research-information?t=2&query=id%3A1137904

Using Algorithmic Complexity Metrics for Process-Oriented Specifications

Συγγραφείς: Abramenko, Artyom, Zyubin, Vladimir

Πηγή: 2025 IEEE 26th International Conference of Young Professionals in Electron Devices and Materials (EDM) Young Professionals in Electron Devices and Materials (EDM), 2025 IEEE 26th International Conference of. :1430-1434 Jun, 2025

Relation: 2025 IEEE 26th International Conference of Young Professionals in Electron Devices and Materials (EDM)

Machine learning correction of satellite precipitation is governed by mechanism purity, not algorithmic complexity: a proof-of-concept study in Hunan, China, with pre-registered cross-regional validation

Συγγραφείς: Xu, Yi

Θεματικοί όροι: Atmospheric and Oceanic Physics, Data Analysis, Statistics and Probability

Σύνδεσμος πρόσβασης: https://arxiv.org/abs/2608.12988

Tighter Bounds for Algorithmic Complexity Estimation Using a Reusable Code-Based Block Decomposition Method

Συγγραφείς: Sakabe, Eduardo Yuji, Abrahão, Felipe S., Hernández-Orozco, Santiago, Gudwin, Ricardo, Zenil, Hector

Θεματικοί όροι: Information Theory, Computational Complexity

Σύνδεσμος πρόσβασης: https://arxiv.org/abs/2606.23471

Characterizing Learning in Deep Neural Networks using Tractable Algorithmic Complexity Analysis

Συγγραφείς: Bakhtiarifard, Pedram, Wilson, Sophia N., Afifi, Mahmoud, Wenshøj, Jonathan, Selvan, Raghavendra

Θεματικοί όροι: Machine Learning

Σύνδεσμος πρόσβασης: https://arxiv.org/abs/2605.15551

Optimizing Quantum Algorithmic Complexity through Hybrid Variational Models

Συγγραφείς: Meera Durga, Mastan Mohammed, Shaik, Rahimullah, Spandana, K., Siva Rama Krishna, Boddu L V, Pavithra, J, Vikruthi, Sriharsha

Πηγή: 2026 International Conference on AI-Driven Smart Systems and Ubiquitous Computing (ICAUC) AI-Driven Smart Systems and Ubiquitous Computing (ICAUC), 2026 International Conference on. :1546-1551 Jan, 2026

Relation: 2026 International Conference on AI-Driven Smart Systems and Ubiquitous Computing (ICAUC)

ShadowProbe: Language-Extensible Detection of Hidden Algorithmic Complexity Vulnerabilities

Συγγραφείς: Xie, Yuanmin, Wu, Xiangfan, Wu, Wenhao, Ying, Lingyun, Liu, Puzhuo, Qu, Haipeng, Chen, Zhongyuan, Zhou, Min, Sun, Chengnian

Θεματικοί όροι: Cryptography and Security, Software Engineering

Σύνδεσμος πρόσβασης: https://arxiv.org/abs/2607.05474

Microscopic Structure of Random 3-SAT: A Discrete Geometric Approach to Phase Transitions and Algorithmic Complexity

Συγγραφείς: Zhan, Yongjian

Θεματικοί όροι: Computational Complexity, Discrete Mathematics, Data Structures and Algorithms

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2602.23411

WebTrap: Adaptive detection and mitigation of algorithmic complexity attacks on web endpoints

Συγγραφείς: Almohri, Hussain M.J.

Πηγή: In Computers & Security December 2026 171

Optimal algorithmic complexity of inference in quantum kernel methods

Συγγραφείς: Gil-Fuster, Elies, Shin, Seongwook, Jerbi, Sofiene, Eisert, Jens, Kramer, Maximilian J.

Θεματικοί όροι: Quantum Physics, Machine Learning

Σύνδεσμος πρόσβασης: https://arxiv.org/abs/2604.15214

Research of the Relationship Between Algorithmic Complexity and Gas Consumption by Sorting Algorithms in Smart Contracts

Συγγραφείς: Pasarar, Andrii, Antoshchuk, Svitlana, Boltenkov, Viktor

Πηγή: 2023 IEEE 1st Ukrainian Distributed Ledger Technology Forum (UADLTF) Ukrainian Distributed Ledger Technology Forum (UADLTF), 2023 IEEE 1st. :1-4 Oct, 2023

Relation: 2023 IEEE 1st Ukrainian Distributed Ledger Technology Forum (UADLTF)

Lower Bounds for the Algorithmic Complexity of Learned Indexes

Συγγραφείς: Croquevielle, Luis Alberto, Sokolovskii, Roman, Heinis, Thomas

Θεματικοί όροι: Data Structures and Algorithms, Machine Learning

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2601.06629

Estimations of Integrated Information Based on Algorithmic Complexity and Dynamic Querying

Συγγραφείς: Hernández-Espinosa, A, Author, Zenil, H, Author, Kiani, NA, Author, Tegnér, J, Author

Συνεισφορές: Hernández-Espinosa, A, Author, Zenil, H, Author, Kiani, NA, Author, Tegnér, J, Author

Πηγή: Handbook of Unconventional Computing. :171-219

Σύνδεσμος πρόσβασης: https://ki.se/en/research/search-research-information?t=2&query=id%3A737946

The Harder You Try, The Harder You Fail: The KeyTrap Denial-of-Service Algorithmic Complexity Attacks on DNSSEC

Συγγραφείς: Heftrig, Elias, Schulmann, Haya, Vogel, Niklas, Waidner, Michael

Πηγή: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security. :497-510

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3658644.3670389

Multi-Metric Algorithmic Complexity: Beyond Asymptotic Analysis

Συγγραφείς: Kavun, Sergii

Θεματικοί όροι: Performance, Hardware Architecture, Computational Complexity, Data Structures and Algorithms, 68Q25, 68M20, 68W40, 91B74, D.4.8; C.4; F.2.2; K.6.2

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2508.13249

SurgeProtector : mitigating temporal algorithmic complexity attacks using adversarial scheduling

Συγγραφείς: Atre, Nirav, Sadok, Hugo, Chiang, Erica, Wang, Weina, Sherry, Justine

Πηγή: Proceedings of the ACM SIGCOMM 2022 Conference. :723-738

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3544216.3544250

Algorithmic Complexity Attacks on All Learned Cardinality Estimators: A Data-centric Approach

Συγγραφείς: Li, Yingze, Liu, Xianglong, Wang, Dong, Wang, Zixuan, Wang, Hongzhi, Zhang, Kaixing, Guan, Yiming

Θεματικοί όροι: Databases

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2507.07438

Homological Invariants and the Algorithmic Complexity of Algebraic Expression Isomorphism

Συγγραφείς: SÉRGIO DE ANDRADE, PAULO

Θεματικοί όροι: Betti Numbers, Invariant Theory, Computational Topology, Algorithmic Complexity, Algebraic Expression Isomorphism, Homological Algebra

On the Empirical Agreement Between Compression and Program-Execution Approaches to Algorithmic Complexity: A Controlled Study Using BDM

Συγγραφείς: Zoe Leyva-Acosta, Eduardo Acuña Yeomans, Francisco Hernández-Quiroz

Πηγή: Entropy, Vol 28, Iss 6, p 601 (2026)

Θεματικοί όροι: algorithmic complexity, Coding Theorem Method, Block Decomposition Method, compresion-based estimates, Science, Astrophysics, QB460-466, Physics, QC1-999

Περιγραφή αρχείου: electronic resource

Relation: https://www.mdpi.com/1099-4300/28/6/601; https://doaj.org/toc/1099-4300

Σύνδεσμος πρόσβασης: https://doaj.org/article/092bc7a87fdd4eb79029d542d76afd56

Algorithmic complexity for theories of commutative Kleene algebras

Συγγραφείς: Kuznetsov, Stepan L.

Πηγή: Izvestiya: Mathematics. 88:236-269

Θεματικοί όροι: infinitary logic, Decidability of theories and sets of sentences, Other infinitary logic, algorithmic complexity, Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics), Undecidability and degrees of sets of sentences, Cut-elimination and normal-form theorems, 0102 computer and information sciences, Kleene algebras, 0101 mathematics, 01 natural sciences, Other algebras related to logic

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/7838022
https://doi.org/10.4213/im9480e