Recent papers on scalability computational problems dimensional numbers

Sorted by publication year (newest first) via OpenAlex. List regenerates every 24h.

  1. Problem Reductions at Scale: Agentic Integration of Computationally Hard Problems

    2026 · ArXiv.org · Pan, Xi-Wei, An, Shi-Wen, Liu, Jin-Guo

    2026
  2. High-speed arithmetic units are foundational to modern computing architectures. However, the performance of these units is fundamentally constrained by the carry propagation delay. In conventional architectures, generating an output bit or digit relies on the temporal propagation of a carry signal from less significant positions. For an operand of length N, traditional Ripple Carry Adders (RCA) exhibit a linear time complexity of O(N), while advanced parallel- prefix structures, such as Carry-Lookahead Adders (CLA) or Wallace trees, reduce this delay to a logarithmic bound of O(log N). [12]. This paper challenges the necessity of this tempo- ral dependency in specific arithmetic domains. We in- troduce a novel Radix-10 scalar multiplication architec- ture—multiplying an N-digit operand by a single-digit multiplier (M ∈ {0, 1, . . . , 9})—that operates in strictly constant time, O(1). Rather than treating the carry as a dynamic signal that must ripple through the circuit, our methodology frames multiplication as a localized state-space mapping problem. We demonstrate that for any single-digit multiplier M, the maximum influence of a carry generated at any position i does not propagate beyond position i+2. By establishing this strict mathematical boundary (∆ = 2), the computational dependency of any output digit yi is **spatially truncated** [6]. Consequently, the output digit yi is computed as a direct, parallel combinational function of only three vari- ables: the current input digit (di) and its two immediate less-significant adjacent digits (di−1 and di−2). To handle the boundaries of the operand without breaking the O(1) property, we introduce the concept of **Structural Imaginary Zeros**—fixed zero digits appended at both ends of the digit sequence—which act as static boundary conditions. This localized dependency allows the entire multiplication process to be mapped into parallel Look-Up Tables (LUTs), resolving the N-digit output in a single standard gate delay cycle (tgate), independent of N. The primary contributions of this paper are: • A formal mathematical proof (Section 5) bounding the carry propagation in scalar Radix-10 multiplication to a strict dependency window of ∆ = 2. • The design of a parallel, O(1) hardware architecture using localized combinational mapping (LUTs) to replace sequential carry logic. • Hardware complexity analysis demonstrating O(1) time delay with strictly linear O(N) area scaling.

    2026 · Zenodo (CERN European Organization for Nuclear Research) · Al-Naami, Abdul Raouf

    2026
  3. Universal Informational Invariant 0.045 and the "CREATION" (ТВОРЕНИЕ) Framework for Cosmological Constant Resolution Abstract: This paper presents the theoretical foundations of "CREATION" (ТВОРЕНИЕ) technology, based on the discovery of a universal informational invariant,I=0.045cap I equals 0.045 𝐼=0.045. Key Findings: Resolution of the Cosmological Constant Problem: The model eliminates the 120-orders-of-magnitude discrepancy between theoretical vacuum energy and observational data by interpreting baryonic matter ( mc2m c squared 𝑚𝑐2) as a result of resonant compression within the global information field. The 0.045 Invariant: It is mathematically demonstrated that the density of visible matter is a fundamental system efficiency constant (the "Efficiency of the Universe"). Using this parameter, the masses of fundamental particles (Higgs boson, Electron) are calculated as harmonics of the Planck scale. Geometric Adaptation: The framework introduces the concept of informational resonance, where gravity is redefined as the computational load required by the system to maintain the material interface. Technological Potential: The model predicts the possibility of direct space-time navigation through resonant interaction with the "Dark Sector" (95.5% of the total energy density). Research Status: Independent Research / Proprietary Framework. Origin: Ukraine. Author: Serhii Chekaliuk

    2026 · Zenodo (CERN European Organization for Nuclear Research) · Sergiy, Chekalyuk

    2026
  4. 2025
  5. Scalable decision fusion algorithm for enabling decentralized computation in distributed, big data clustering problems

    2024 · International Journal of Machine Learning and Cybernetics · Jennath, H. S., Asharaf, S.

    2024
  6. 2024
  7. Multigrid methods for large-scale problems: approximate coarsest-level solves and mixed precision computation

    2024 · Digital Repository (National Repository of Grey Literature) · Vacek, Petr

    2024
  8. Multi-{Physics, Phase, Scale} Computational Modeling of Interface-Coupled Problems in Redox Flow Battery Design

    2023 · ECS Meeting Abstracts · Barzegari, Mojtaba, Heijden, Maxime van der, Haas, V. et al.

    2023
  9. Scalable Computation of Dynamic Flow Problems via Multimarginal Graph-Structured Optimal Transport

    2023 · Mathematics of Operations Research · Haasler, Isabel, Ringh, Axel, Chen, Yongxin et al.

    2023
  10. Computational cost reduction for coupled system of multiple scale reaction diffusion problems with mixed type boundary conditions having boundary layers

    2023 · Revista de la Real Academia de Ciencias Exactas Físicas y Naturales Serie A Matemáticas · Saini, Sumit, Das, Pratibhamoy, Kumar, Sunil

    2023
  11. Multi-scale computational method for nonlinear dynamic thermo-mechanical problems of composite materials with temperature-dependent properties

    2022 · Communications in Nonlinear Science and Numerical Simulation · Dong, Hao, Cui, Junzhi, Nie, Yufeng et al.

    2022
  12. Computational scaling of SPH simulations for violent sloshing problems in aircraft fuel tanks

    2022 · Acta Mechanica Sinica · Calderón-Sánchez, Javier, Martinez-Carrascal, Jon, Miguel, González Leo

    2022

Command palette

Jump anywhere, run any action.