The paper proposes a Secure Parallel Determinant Computation (SPDC) framework that enables efficient, privacy-preserving, and scalable matrix determinant calculation across multiple untrusted edge ser…

This paper proves that the minimum edge-outerplanarity of a planar graph can be computed in polynomial time.

The paper proves that platform-deterministic inference is a necessary and sufficient condition for trustworthy AI, establishing that AI trust fundamentally relies on consistent arithmetic.

This paper introduces a new distributed computational model called the uniform port model, which allows for efficient self-stabilizing algorithms for local symmetry breaking problems on general graphs…

The paper introduces Post-Deterministic Distributed Systems (PDDS) as a new model to coordinate autonomous infrastructure where participants, including stochastic agents, produce divergent reasoning p…

This paper studies a random compositional model for the growth of affine regions in deep piecewise-linear networks and proves the existence of a submultiplicative pressure for the number of affine pie…

The paper proves XNLP-hardness of Directed Edge Geography and Undirected Edge Geography when parameterized by pathwidth, and shows their fixed-parameter tractability when parameterized by treewidth an…

This paper presents an optimized algorithm for computing cut sets of a path set in graph theory and introduces a vectorized computational framework for property calculations.

This paper presents approximation algorithms for the one-way directed Reachability-Preserving Minimum Edge Cut problem in directed graphs.

This paper proposes a reliability-aware framework to solve the fuzzy shortest path problem in directed graphs, optimizing routes based not only on cost but also on the reliability of the associated fu…

This paper analyzes the computational complexity of verifying feedforward neural networks when their weights are restricted to finite-width arithmetic, finding that verification remains NP-complete fo…

This paper proposes a framework for functional stability in edge computing systems, focusing on individual functions and their quality thresholds.

This paper studies the decidability and complexity properties of unary three-way and two-way deterministic and nondeterministic two-dimensional automata.

This paper studies the behavior and complexity of randomized algorithms that may terminate almost surely but run forever on exceptional random tapes. It provides bounds on the survival tail, Kolmogoro…

This paper improves the time complexity of exact algorithms for converting a connected graph into a cactus by reducing it from O*(3^n) to O*(2^n) for unweighted graphs, and provides faster algorithms…