Envy-Free Cake-Cutting for Four Agents.

Συγγραφείς: Hollender, Alexandros¹ (AUTHOR) alexandros.hollender@cs.ox.ac.uk, Rubinstein, Aviad² (AUTHOR) aviad@stanford.edu

Πηγή: Journal of the ACM. Oct2025, Vol. 72 Issue 5, p1-54. 54p.

Θεματικοί όροι: *HEURISTIC, *ALGORITHMS, *RESOURCE allocation, COMPUTATIONAL complexity, COMMUNICATION complexity (Information theory), FAIRNESS

Parameterized Inapproximability Hypothesis under ETH.

Συγγραφείς: Guruswami, Venkatesan¹ (AUTHOR) venkatg@berkeley.edu, Lin, Bingkai² (AUTHOR) lin@nju.edu.cn, Ren, Xuandi¹ (AUTHOR) xuandi_ren@berkeley.edu, Sun, Yican³ (AUTHOR) sycpku@pku.edu.cn, Wu, Kewen¹ (AUTHOR) shlw_kevin@hotmail.com

Πηγή: Journal of the ACM. Oct2025, Vol. 72 Issue 5, p1-40. 40p.

Θεματικοί όροι: COMPUTATIONAL complexity, CONSTRAINT satisfaction, HADAMARD codes

Vertex Connectivity in Poly-logarithmic Max-Flows.

Συγγραφείς: Li, Jason¹ (AUTHOR) jmli@cs.cmu.edu, Nanongkai, Danupon² (AUTHOR) danupon@gmail.com, Panigrahi, Debmalya³ (AUTHOR) debmalya@cs.duke.edu, Saranurak, Thatchaphol⁴ (AUTHOR) thsa@umich.edu, Yingchareonthawornchai, Sorrachai⁵ (AUTHOR) sorrachai.cp@gmail.com

Πηγή: Journal of the ACM. Aug2025, Vol. 72 Issue 4, p1-34. 34p.

Θεματικοί όροι: *ALGORITHMS, GRAPH connectivity, COMPUTATIONAL complexity, DIRECTED graphs, UNDIRECTED graphs

Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits.

Συγγραφείς: Limaye, Nutan¹ (AUTHOR) nuli@itu.dk, Srinivasan, Srikanth² (AUTHOR) srikanth@math.iitb.ac.in, Tavenas, Sébastien³ (AUTHOR) sebastien.tavenas@univ-smb.fr

Πηγή: Journal of the ACM. Aug2025, Vol. 72 Issue 4, p1-35. 35p.

Θεματικοί όροι: COMPUTATIONAL complexity, CIRCUIT complexity, POLYNOMIALS, COMPUTER circuits, MATHEMATICAL bounds

Medium-Term Electric Load Forecasting: A Benchmark Study of Transformer-Based and Linear-Based Methods

Συγγραφείς: Li, Yuran, Wu, Di, Jenkin, Michael, Zinflou, Arnaud, Boulet, Benoit

Πηγή: 2025 IEEE Electrical Power and Energy Conference (EPEC) Electrical Power and Energy Conference (EPEC), 2025 IEEE. :182-188 Oct, 2025

Relation: 2025 IEEE Electrical Power and Energy Conference (EPEC)

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

Συγγραφείς: Shi, Yanmei¹ (AUTHOR), Guo, Xu¹ (AUTHOR), Zhang, Xinyu² (AUTHOR), Ding, Jiarong¹ (AUTHOR) djr9901@mail.bnu.edu.cn

Πηγή: Statistica Neerlandica. Nov2025, Vol. 79 Issue 4, p1-22. 22p.

Θεματικοί όροι: *STATISTICAL hypothesis testing, *REGRESSION analysis, *EMPIRICAL research, COMPUTATIONAL complexity, STATISTICAL bootstrapping, STATISTICAL models

PSPACE-Completeness of Reversible Deterministic Systems.

Συγγραφείς: Demaine, Erik D.¹ (AUTHOR) edemaine@mit.edu, Hearn, Robert A.¹ (AUTHOR) bob@hearn.to, Hendrickson, Dylan¹ (AUTHOR) dylanhen@mit.edu, Lynch, Jayson¹ (AUTHOR) jaysonl@mit.edu

Πηγή: International Journal of Foundations of Computer Science. Nov2025, Vol. 36 Issue 7, p1041-1062. 22p.

Θεματικοί όροι: REVERSIBLE computing, COMPUTATIONAL complexity, DETERMINISTIC algorithms, PLANNING techniques, CONSTRAINT programming

Complexity and Time.

Συγγραφείς: Enke, Benjamin¹ (AUTHOR), Graeber, Thomas² (AUTHOR), Oprea, Ryan³ (AUTHOR)

Πηγή: Journal of the European Economic Association. Oct2025, Vol. 23 Issue 5, p1838-1867. 30p.

Θεματικοί όροι: *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.

Συγγραφείς: Gratton, S.¹ (AUTHOR) serge.gratton@enseeiht.fr, Sim, C.-K.² (AUTHOR) chee-khian.sim@port.ac.uk, Toint, Ph. L.³ (AUTHOR) philippe.toint@unamur.be

Πηγή: Computational Optimization & Applications. Nov2025, Vol. 92 Issue 2, p515-527. 13p.

Θεματικοί όροι: *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.

Συγγραφείς: Sebastian, Jincy^1,2 (AUTHOR) jincysebastian@amaljyothi.ac.in, Mathew, Lisa¹ (AUTHOR) lisamathew@amaljyothi.ac.in

Πηγή: International Journal of Foundations of Computer Science. Oct2025, p1-17. 17p.

Θεματικοί όροι: FORMAL languages, COMPUTATIONAL complexity

Accelerating Signed Distance Functions.

Συγγραφείς: Hubert‐Brierre, Pierre¹ (AUTHOR), Guérin, Eric² (AUTHOR), Peytavie, Adrien¹ (AUTHOR), Galin, Eric¹ (AUTHOR)

Πηγή: Computer Graphics Forum. Oct2025, Vol. 44 Issue 7, p1-12. 12p.

Θεματικοί όροι: *DATA structures, OPTIMIZATION algorithms, COMPUTATIONAL complexity, LEVEL set methods, POLYGONS

Identifying Antifragile Communities in Complex Networks by Complexity Assessment.

Συγγραφείς: Bayat, Muhammad¹ (AUTHOR), Khansari, Mohammad¹ (AUTHOR) m.khansari@ut.ac.ir

Πηγή: Systems Research & Behavioral Science. Oct2025, p1. 16p. 12 Illustrations.

Θεματικοί όροι: *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.

Συγγραφείς: Mösching, Alexandre¹ (AUTHOR), Li, Housen² (AUTHOR) housen.li@mathematik.uni-goettingen.de, Munk, Axel² (AUTHOR)

Πηγή: Journal of Computational & Graphical Statistics. Oct2025, p1-26. 26p. 9 Illustrations.

Θεματικοί όροι: *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.

Συγγραφείς: Andreani, R.¹ (AUTHOR) andreani@ime.unicamp.br, Haeser, G.² (AUTHOR) ghaeser@ime.usp.br, Schuverdt, M. L.³ (AUTHOR) schuverd@mate.unlp.edu.ar, Secchin, L. D.⁴ (AUTHOR) leonardo.secchin@ufes.br

Πηγή: SIAM Journal on Optimization. 2025, Vol. 35 Issue 4, p2474-2489. 16p.

Θεματικοί όροι: *MATHEMATICAL optimization, LAGRANGE multiplier, COMPUTATIONAL complexity, STABILITY criterion, CONSTRAINT satisfaction, CONSTRAINT algorithms

A Novel Quasi Accelerated Over-Relaxation Method for Efficient Signal Detection

Συγγραφείς: Nauman Irshad, M., Muzamil Aslam, M., Akhtar, M., Silapunt, R.

Πηγή: IEEE Communications Letters IEEE Commun. Lett. Communications Letters, IEEE. 29(11):2581-2585 Nov, 2025

An Efficient Reduction Method for Available Time Intervals of Large-Scale Demand-Side Resources

Συγγραφείς: Wei, H., Jiang, H., Zhang, J., Botterud, A., Zhang, N., Kang, C.

Πηγή: IEEE Transactions on Smart Grid IEEE Trans. Smart Grid Smart Grid, IEEE Transactions on. 16(6):4741-4754 Nov, 2025

Cyclic Shift Phase Rotation: An Innovative, Low-Complexity Technique for PAPR Reduction

Συγγραφείς: Alnaseri, O., Alzubaidi, L., Timmermann, J.

Πηγή: IEEE Transactions on Communications IEEE Trans. Commun. Communications, IEEE Transactions on. 73(11):10738-10750 Nov, 2025

RevealNet: Distributed Traffic Correlation for Attack Attribution on Programmable Networks

Συγγραφείς: Singh, Gurjot, Dhanani, Alim, Barradas, Diogo

Πηγή: 2025 23rd International Symposium on Network Computing and Applications (NCA) NCA Network Computing and Applications (NCA), 2025 23rd International Symposium on. :209-218 Nov, 2025

Relation: 2025 23rd International Symposium on Network Computing and Applications (NCA)

A Method of Cryptographically Strong Pseudorandom Sequences Generation for Forming a One-Time Pad

Συγγραφείς: Grozov, Vladimir, Budko, Mikhail, Guirik, Alexei

Πηγή: 2025 38th Conference of Open Innovations Association (FRUCT) Open Innovations Association (FRUCT), 2025 38th Conference of. :82-89 Nov, 2025

Relation: 2025 38th Conference of Open Innovations Association (FRUCT)

Quantization-Aware Optimization for Breadth-First Search Detection in MIMO Systems

Συγγραφείς: Zhang, Xingchi, Zheng, Jian, Sun, Yutai, Zhou, Wenyue, Tan, Xiaosi, Zhang, Chuan

Πηγή: 2025 IEEE Workshop on Signal Processing Systems (SiPS) Signal Processing Systems (SiPS), 2025 IEEE Workshop on. :1-5 Nov, 2025

Relation: 2025 IEEE Workshop on Signal Processing Systems (SiPS)