Suchergebnisse - "computational complexity"

Envy-Free Cake-Cutting for Four Agents.

Autoren: Hollender, Alexandros Rubinstein, Aviad

Quelle: Journal of the ACM. Oct2025, Vol. 72 Issue 5, p1-54. 54p.

Schlagwörter: *HEURISTIC, *ALGORITHMS, *RESOURCE allocation, COMPUTATIONAL complexity, COMMUNICATION complexity (Information theory), FAIRNESS

Parameterized Inapproximability Hypothesis under ETH.

Autoren: Guruswami, Venkatesan Lin, Bingkai Ren, Xuandi et al.

Quelle: Journal of the ACM. Oct2025, Vol. 72 Issue 5, p1-40. 40p.

Schlagwörter: COMPUTATIONAL complexity, CONSTRAINT satisfaction, HADAMARD codes

Vertex Connectivity in Poly-logarithmic Max-Flows.

Autoren: Li, Jason Nanongkai, Danupon Panigrahi, Debmalya et al.

Quelle: Journal of the ACM. Aug2025, Vol. 72 Issue 4, p1-34. 34p.

Schlagwörter: *ALGORITHMS, GRAPH connectivity, COMPUTATIONAL complexity, DIRECTED graphs, UNDIRECTED graphs

Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits.

Autoren: Limaye, Nutan Srinivasan, Srikanth Tavenas, Sébastien

Quelle: Journal of the ACM. Aug2025, Vol. 72 Issue 4, p1-35. 35p.

Schlagwörter: COMPUTATIONAL complexity, CIRCUIT complexity, POLYNOMIALS, COMPUTER circuits, MATHEMATICAL bounds

A refined bootstrap procedure for high‐dimensional factor‐augmented regression models.

Autoren: Shi, Yanmei Guo, Xu Zhang, Xinyu et al.

Quelle: Statistica Neerlandica. Nov2025, Vol. 79 Issue 4, p1-22. 22p.

Schlagwörter: *STATISTICAL hypothesis testing, *REGRESSION analysis, *EMPIRICAL research, COMPUTATIONAL complexity, STATISTICAL bootstrapping, STATISTICAL models

PSPACE-Completeness of Reversible Deterministic Systems.

Autoren: Demaine, Erik D. Hearn, Robert A. Hendrickson, Dylan et al.

Quelle: International Journal of Foundations of Computer Science. Nov2025, Vol. 36 Issue 7, p1041-1062. 22p.

Schlagwörter: REVERSIBLE computing, COMPUTATIONAL complexity, DETERMINISTIC algorithms, PLANNING techniques, CONSTRAINT programming

Complexity and Time.

Autoren: Enke, Benjamin Graeber, Thomas Oprea, Ryan

Quelle: Journal of the European Economic Association. Oct2025, Vol. 23 Issue 5, p1838-1867. 30p.

Schlagwörter: *MONETARY incentives, COMPUTATIONAL complexity, DELAY of gratification, COGNITIVE load, COMPLEXITY (Philosophy), RESEARCH methodology, PATIENCE

Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is rather than.

Autoren: Gratton, S. Sim, C.-K. Toint, Ph. L.

Quelle: Computational Optimization & Applications. Nov2025, Vol. 92 Issue 2, p515-527. 13p.

Schlagwörter: *ALGORITHMS, ASYMPTOTIC analysis, COMPUTATIONAL complexity, METHOD of steepest descent (Numerical analysis), MATHEMATICAL bounds, NONSMOOTH optimization, NONCONVEX programming

Control Languages Associated with Labelled Spiking Neural P Systems with Mute Rules.

Autoren: Sebastian, Jincy Mathew, Lisa

Quelle: International Journal of Foundations of Computer Science. Oct2025, p1-17. 17p.

Schlagwörter: FORMAL languages, COMPUTATIONAL complexity

Accelerating Signed Distance Functions.

Autoren: Hubert‐Brierre, Pierre Guérin, Eric Peytavie, Adrien et al.

Quelle: Computer Graphics Forum. Oct2025, Vol. 44 Issue 7, p1-12. 12p.

Schlagwörter: *DATA structures, OPTIMIZATION algorithms, COMPUTATIONAL complexity, LEVEL set methods, POLYGONS

Identifying Antifragile Communities in Complex Networks by Complexity Assessment.

Autoren: Bayat, Muhammad Khansari, Mohammad

Quelle: Systems Research & Behavioral Science. Oct2025, p1. 16p. 12 Illustrations.

Schlagwörter: *STATISTICAL correlation, *ADAPTIVE control systems, ENTROPY, COMPUTATIONAL complexity, SYSTEM dynamics, COMPLEXITY (Philosophy), PERTURBATION theory

Quick Adaptive Ternary Segmentation: An Efficient Decoding Procedure For Hidden Markov Models.

Autoren: Mösching, Alexandre Li, Housen Munk, Axel

Quelle: Journal of Computational & Graphical Statistics. Oct2025, p1-26. 26p. 9 Illustrations.

Schlagwörter: *SIMULATION methods & models, HIDDEN Markov models, COMPUTATIONAL complexity, STATISTICAL measurement, DECODING algorithms, DATA management

A Relaxed Quasinormality Condition and the Boundedness of Dual Augmented Lagrangian Sequences.

Autoren: Andreani, R. Haeser, G. Schuverdt, M. L. et al.

Quelle: SIAM Journal on Optimization. 2025, Vol. 35 Issue 4, p2474-2489. 16p.

Schlagwörter: *MATHEMATICAL optimization, LAGRANGE multiplier, COMPUTATIONAL complexity, STABILITY criterion, CONSTRAINT satisfaction, CONSTRAINT algorithms

E-PSOGA: An Enhanced Hybrid Metaheuristic for Optimal Edge-to-Cloud Placement of Services with Multi-Version Components

Autoren: Garshasbi Herabad, Mohammadsadeq Taheri, Javid Ahmed, Bestoun S. et al.

Quelle: IEEE Access. 13:151170-151188

Schlagwörter: Augmented reality, Complex networks, Computational complexity, Computational efficiency, Heuristic algorithms, Quality of service, Reliability, Repair, Response time (computer systems), Virtual reality, Cloud-computing, Edge-to-cloud computing, Multi-version, Optimal service placement, Particle swarm, Particle swarm optimization, Runtimes, Service placements, Solution quality, Swarm optimization, Genetic algorithms, Particle swarm optimization (PSO), Computer Science, Datavetenskap

Dateibeschreibung: electronic

Zugangs-URL: https://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-106828
https://doi.org/10.1109/ACCESS.2025.3603329

Priority-Driven Constraints Softening in Safe MPC for Perturbed Systems

Autoren: Quan, Yingshuai Jeddi, Mohammad Prignoli, Francesco et al.

Quelle: 5G för Uppkopplade Autonoma Fordon i Komplexa Stadsmiljöer IEEE Control Systems Letters. 9:1069-1074

Schlagwörter: Softening, Model predictive control, Simulation, Control systems, Predictive control, Autonomous vehicles, Dynamical systems, constrained control, Optimization, Computational complexity, uncertain systems, Uncertain systems, Safety, safety critical

Dateibeschreibung: electronic

Zugangs-URL: https://research.chalmers.se/publication/547508
https://research.chalmers.se/publication/547508/file/547508_Fulltext.pdf

Complexity of Faceted Explanations in Propositional Abduction

Autoren: Schmidt, Johannes Maizia, Mohamed Lagerkvist, Victor et al.

Quelle: eLLIIT – The Linköping – Lund Initiative on IT and Mobile Communication Theory and Practice of Logic Programming. 25(4):775-793

Schlagwörter: computational complexity, fine-grained reasoning, Post’s framework, propositional abduction

Dateibeschreibung: electronic

Zugangs-URL: https://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-214265
https://doi.org/10.1017/S1471068425100215

Quantum phase transition of sub-Ohmic spin-boson models: An approach by the multiple Davydov D2Ansatz.

Autoren: Tan, Justin Zhengjie Zhou, Nengji Zhao, Yang

Quelle: Journal of Chemical Physics; 11/7/2025, Vol. 163 Issue 17, p1-9, 9p

Schlagwörter: QUANTUM phase transitions, GROUND state (Quantum mechanics), VARIATIONAL principles, COMPUTATIONAL complexity, DAVYDOV splitting

Dependency Network Structure and Security Vulnerabilities in Software Supply Chains.

Autoren: Yoo, Eunae Craighead, Christopher W. Samtani, Sagar

Quelle: Journal of Management Information Systems; 2025, Vol. 42 Issue 4, p1149-1176, 28p

Schlagwörter: COMPUTER security vulnerabilities, SUPPLY chains, STATISTICAL correlation, COMPUTER software developers, COMPUTATIONAL complexity

The Complexity of Computing KKT Solutions of Quadratic Programs.

Autoren: Fearnley, John Goldberg, Paul Hollender, Alexandros et al.

Quelle: Journal of the ACM; Oct2025, Vol. 72 Issue 5, p1-48, 48p

Schlagwörter: QUADRATIC programming, NP-hard problems, OPTIMIZATION algorithms, COMPUTATIONAL complexity, NONCONVEX programming

The Days On Days Off Scheduling Problem.

Autoren: Nießen, Fabien Paschmanns, Paul

Quelle: European Journal of Operational Research. Feb2026, Vol. 329 Issue 1, p79-86. 8p.

Schlagwörter: *HOSPITALITY industry, *LABOR supply, *ALGORITHMS, *SCHEDULING, NP-hard problems, COMPUTATIONAL complexity, SCHOLARLY method