Low-Complexity Approximations of the WECS Method for SAR Change Detection

Authors: Portella, L., Cintra, R.J., Pinheiro, A.

Source: IEEE Signal Processing Letters IEEE Signal Process. Lett. Signal Processing Letters, IEEE. 33:643-647 2026

On the Complexities of the Incremental Bottleneck and Bottleneck Terminal Steiner Tree Problems

Authors: Chen, Yen Hung

Source: 2016 International Computer Symposium (ICS) ICS Computer Symposium (ICS), 2016 International. :1-5 Dec, 2016

Relation: 2016 International Computer Symposium (ICS)

Near-neighbor preserving dimension reduction via coverings for doubling subsets of ℓ1: Near-neighbor preserving dimension reduction via coverings for doubling subsets of \(\ell_1\)

Authors: Emiris, Ioannis Z., Margonis, Vasilis, Psarros, Ioannis

Contributors: Emiris, Ioannis

Source: Theoretical Computer Science

Subject Terms: doubling dimension, Randomized algorithms, approximate nearest neighbor, [MATH.MATH-GM] Mathematics [math]/General Mathematics [math.GM], 0102 computer and information sciences, 02 engineering and technology, [INFO] Computer Science [cs], Metric embeddings as related to computational problems and algorithms, Manhattan metric, 01 natural sciences, Computational aspects of data analysis and big data, Complexity & approximation, randomized embedding, Cauchy distribution, 0202 electrical engineering, electronic engineering, information engineering, METRIC geometry, dimensionality reduction

File Description: application/xml; application/pdf

Access URL: https://hal.science/hal-04294296v1
https://hal.science/hal-04294296v1/document
https://doi.org/10.1016/j.tcs.2022.11.031
https://pergamos.lib.uoa.gr/uoa/dl/object/3340533

Representation-Dependent Contact Hypothesis (RDCH) Toward a Discipline of Structural Xenoarchaeology: Viability, Non-Recognition, and Compressed Signals in Early Human Systems

Authors: Lukin, Roman

Subject Terms: Representation learning limits, Stability functional, Signal detection under constraints, Information bottlenecks, Bounded adaptive systems, Structural detectability, Architectural alignment patterns, Viability-aware intelligence, Symbolic compression, Compressed representations, Complex adaptive systems, Epistemic constraints, Information as constrained resource, Ancient signal encoding, Nonlinear dynamics, Archaeological anomaly detection, Kolmogorov complexity (approximation), Structural xenoarchaeology, Viability-limited knowledge, Multi-scale coherence, Representation-dependent detectability, Intelligence as stability, Artificial general intelligence (AGI), Adaptive systems theory, Non-natural structure criteria, Viability constraints, Non-recognition hypothesis, Detectability limits in physics, Interdisciplinary theory, Information–measurement coupling, Information geometry, Mutual information, Condensation operator, Cognitive filtering, Observer-dependent reality, Signal vs noise problem, Representation mismatch, Informational artifacts, Hidden structure detection

Low-complexity BCJR symbol detection for sparse channels

Authors: Wang, Yulin ^a, Tao, Jun ^{⁎, a}, Yang, Le ^b, Zhang, Zhiheng ^a

Source: In Signal Processing August 2026 245

An Additively Optimal Interpreter for Approximating Kolmogorov Prefix Complexity

Authors: Zoe Leyva-Acosta, Eduardo Acuña Yeomans, Francisco Hernandez-Quiroz

Source: Entropy, Vol 26, Iss 9, p 802 (2024)

Subject Terms: algorithmic complexity, Kolmogorov complexity, coding theorem method, complexity approximation, Science, Astrophysics, QB460-466, Physics, QC1-999

Relation: https://www.mdpi.com/1099-4300/26/9/802; https://doaj.org/toc/1099-4300; https://doaj.org/article/0a3aaae290604bf1b86c3aaab24147b6

Availability: https://doi.org/10.3390/e26090802
https://doaj.org/article/0a3aaae290604bf1b86c3aaab24147b6

Counting Database Repairs under Primary Keys Revisited

Authors: Marco Calautti, Marco Console, Andreas Pieris

Source: Calautti, M, Console, M & Pieris, A 2019, Counting Database Repairs under Primary Keys Revisited. in Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. New York, pp. 104-118, ACM SIGMOD/PODS International Conference on Management of Data (SIGMOD 2019), Amsterdam, Netherlands, 30/06/19. https://doi.org/10.1145/3294052.3319703

Subject Terms: Inconsistency, repairs, primary keys, first-order queries, counting, complexity, approximation schemes, Numeric approximation algorithms, Approximation schemes, Complexity, Counting, First-order queries, Inconsistency, Primary keys, Repairs, 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, Inconsistent data, repairs, primary keys, first-order queries, counting, complexity, approximation schemes, 01 natural sciences

File Description: application/pdf

Access URL: https://www.pure.ed.ac.uk/ws/files/84254105/Counting_Database_Repairs_CALAUTTI_DoA100319_AFV.pdf
https://ceur-ws.org/Vol-2400/paper-41.pdf
https://hdl.handle.net/2434/953304
https://doi.org/10.1145/3294052.3319703
https://hdl.handle.net/20.500.11820/e578c5ef-739e-4f2a-b1a8-e24c517373ce
https://www.research.ed.ac.uk/en/publications/e578c5ef-739e-4f2a-b1a8-e24c517373ce
https://doi.org/10.1145/3294052.3319703
https://www.pure.ed.ac.uk/ws/files/84254105/Counting_Database_Repairs_CALAUTTI_DoA100319_AFV.pdf
https://dl.acm.org/citation.cfm?doid=3294052.3319703
https://hdl.handle.net/11572/260155
http://ceur-ws.org/Vol-2400/paper-41.pdf
https://hdl.handle.net/11573/1501968
https://doi.org/10.1145/3294052.3319703

Complexity Approximation of Classification Task for Large Dataset Ensemble Artificial Neural Networks

Authors: Mohamad, Mumtazimah^Aff40, Saman, Md Yazid Mohd^Aff41, Hamid, Nazirah Abd^Aff40

Contributors: Angrisani, Leopoldo, Series Editor^Aff1, Arteaga, Marco, Series Editor^Aff2, Panigrahi, Bijaya Ketan, Series Editor^Aff3, Chakraborty, Samarjit, Series Editor^Aff4, Chen, Jiming, Series Editor^Aff5, Chen, Shanben, Series Editor^Aff6, Chen, Tan Kay, Series Editor^Aff7, Dillmann, Rüdiger, Series Editor^Aff8, Duan, Haibin, Series Editor^Aff9, Ferrari, Gianluigi, Series Editor^Aff10, Ferre, Manuel, Series Editor^Aff11, Hirche, Sandra, Series Editor^Aff12, Jabbari, Faryar, Series Editor^Aff13, Jia, Limin, Series Editor^Aff14, Kacprzyk, Janusz, Series Editor^Aff15, Khamis, Alaa, Series Editor^Aff16, Kroeger, Torsten, Series Editor^Aff17, Liang, Qilian, Series Editor^Aff18, Martin, Ferran, Series Editor^Aff19, Ming, Tan Cher, Series Editor^Aff20, Minker, Wolfgang, Series Editor^Aff21, Misra, Pradeep, Series Editor^Aff22, Möller, Sebastian, Series Editor^Aff23, Mukhopadhyay, Subhas, Series Editor^Aff24, Ning, Cun-Zheng, Series Editor^Aff25, Nishida, Toyoaki, Series Editor^Aff26, Pascucci, Federica, Series Editor^Aff27, Qin, Yong, Series Editor^Aff28, Seng, Gan Woon, Series Editor^Aff29, Speidel, Joachim, Series Editor^Aff30, Veiga, Germano, Series Editor^Aff31, Wu, Haitao, Series Editor^Aff32, Zhang, Junjie James, Series Editor^Aff33, Abawajy, Jemal H., editor^Aff34, Othman, Mohamed, editor^Aff35, Ghazali, Rozaida, editor^Aff36, Deris, Mustafa Mat, editor^Aff37, Mahdin, Hairulnizam, editor^Aff38, Herawan, Tutut, editor^Aff39

Source: Proceedings of the International Conference on Data Engineering 2015 (DaEng-2015). 520:195-202

Extension of some edge graph problems: Standard, parameterized and approximation complexity

Authors: Casel, Katrin, Fernau, Henning, Khosravian Ghadikolaei, Mehdi, Monnot, Jérôme, Sikora, Florian

Contributors: Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE), Université Paris Dauphine-PSL, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), ANR-17-CE23-0010,ESIGMA,Efficacité et structure pour les applications de la fouille de graphes(2017), ANR-21-CE48-0022,S-EX-AP-PE-AL,Algorithmes d'Approximation Sous-Exponentiels et Paramétrés(2021)

Source: ISSN: 0166-218X ; Discrete Applied Mathematics ; https://hal.science/hal-04218296 ; Discrete Applied Mathematics, 2023, 340, pp.183-201. ⟨10.1016/j.dam.2023.06.042⟩.

Subject Terms: Extension problems Edge Cover Matching Edge Domination NP-completeness Parameterized Complexity Approximation 2020 MSC: 68Q17 68Q25 68Q27, Extension problems, Edge Cover, Matching, Edge Domination, NP-completeness, Parameterized Complexity, Approximation 2020 MSC: 68Q17, 68Q25, 68Q27, [INFO]Computer Science [cs]

Relation: hal-04218296; https://hal.science/hal-04218296; https://hal.science/hal-04218296/document; https://hal.science/hal-04218296/file/Extension_of_some_edge_graph_problems.pdf

Availability: https://hal.science/hal-04218296
https://hal.science/hal-04218296/document
https://hal.science/hal-04218296/file/Extension_of_some_edge_graph_problems.pdf
https://doi.org/10.1016/j.dam.2023.06.042

Approximating Promethee II’s net flow scores by piecewise linear value functions

Authors: Eppe, Stefan ^⁎, De Smet, Yves

Source: In European Journal of Operational Research 16 March 2014 233(3):651-659

Finding occurrences of protein complexes in protein–protein interaction graphs: Finding occurrences of protein complexes in protein-protein interaction graphs

Authors: Fertin, Guillaume, Rizzi, Romeo, Vialette, Stéphane

Contributors: Fertin, Guillaume, Laboratoire d'Informatique de Nantes Atlantique (LINA), Mines Nantes (Mines Nantes)-Université de Nantes - UFR des Sciences et des Techniques (UN UFR ST), Université de Nantes (UN)-Université de Nantes (UN)-Centre National de la Recherche Scientifique (CNRS), Dipartimento di Matematica e Informatica - Universita Udine (DIMI), Università degli Studi di Udine - University of Udine Italie, Laboratoire d'Informatique Gaspard-Monge (LIGM), Université Paris-Est Marne-la-Vallée (UPEM)-École nationale des ponts et chaussées (ENPC)-ESIEE Paris-Fédération de Recherche Bézout (BEZOUT), Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)-Centre National de la Recherche Scientifique (CNRS)

Source: Journal of Discrete Algorithms. 7:90-101

Subject Terms: [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], 0301 basic medicine, Biochemistry, molecular biology, Analysis of algorithms and problem complexity, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], Applications of graph theory, [INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS], Computational biology, Computational complexity, Approximation algorithm, Parameterized complexity, Protein–protein interaction graph, Theoretical Computer Science, 03 medical and health sciences, computational biology, Graph algorithms (graph-theoretic aspects), Discrete Mathematics and Combinatorics, Analysis of algorithms, approximation algorithm, [INFO.INFO-BI] Computer Science [cs]/Bioinformatics [q-bio.QM], parameterized complexity, 0303 health sciences, [SDV.BIBS] Life Sciences [q-bio]/Quantitative Methods [q-bio.QM], computational complexity, [SDV.BIBS]Life Sciences [q-bio]/Quantitative Methods [q-bio.QM], protein-protein interaction graph, Computational Theory and Mathematics, [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-BI]Computer Science [cs]/Bioinformatics [q-bio.QM]

File Description: application/xml; application/pdf

Access URL: https://hal.science/hal-00416394v1
https://hdl.handle.net/11562/409557
https://doi.org/10.1016/j.jda.2008.11.003
http://www.sciencedirect.com/science/article/pii/S1570866708000981

On the Complexity of Wafer-to-Wafer Integration: On the complexity of wafer-to-wafer integration

Authors: Guillerme Duvillié, Marin Bougeret, Vincent Boudet, Trivikram Dokka, Rodolphe Giroudeau

Contributors: Giroudeau, Rodolphe, DUVILLIE, Guillerme, Paschos, Vangelis Th., Widmayer, Peter

Source: Lecture Notes in Computer Science ISBN: 9783319181721
Discrete Optimization, 22

Subject Terms: ILP, Combinatorial optimization, Multidimensional binary vector assignment, Analysis of algorithms and problem complexity, FPT, approximability, 0211 other engineering and technologies, Operational Research, 0102 computer and information sciences, 02 engineering and technology, wafer-to-wafer integration, 01 natural sciences, [INFO.INFO-RO] Computer Science [cs]/Operations Research [math.OC], FPT algorithm, Informatique mathématique, Informatique générale, multidimensional binary vector assignment, Complexity, Approximation algorithms, Wafer-to-Wafer Integration, Complexity & approximation, Approximability, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), [INFO.INFO-CC] Computer Science [cs]/Computational Complexity [cs.CC], Max sum 1, Min sum 0

File Description: application/pdf; application/xml; 1 full-text file(s): application/pdf

Access URL: https://eprints.lancs.ac.uk/id/eprint/76944/1/CIAC2015.pdf
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01250989v1
https://doi.org/10.1007/978-3-319-18173-8_15
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01378579v1
https://doi.org/10.1016/j.disopt.2016.07.001
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01110027v1
https://zbmath.org/6872108
https://doi.org/10.1016/j.disopt.2016.07.001
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/307768
https://dipot.ulb.ac.be/dspace/bitstream/2013/307768/3/DO2016_complexity_of_WWI.pdf
https://eprints.lancs.ac.uk/id/eprint/80661/1/do21.pdf

On the upper chromatic number of (v3,b2)-configurations: On the upper chromatic number of \((v_3,b_2)\)-configurations

Authors: ARBIB, CLAUDIO, FLAMMINI, MICHELE

Source: Discrete Applied Mathematics. 120:3-12

Subject Terms: computational complexity, Applied Mathematics, polynomial-time algorithm, upper chromatic number, 0102 computer and information sciences, Hypergraphs, 01 natural sciences, Approximation algorithms, Coloring of graphs and hypergraphs, mixed hypergraph, Graph theory (including graph drawing) in computer science, Discrete Mathematics and Combinatorics, Upper chromatic number, Hypergraphs, Computational complexity, Approximation algorithms, approximation algorithms

File Description: application/xml

Access URL: https://zbmath.org/1792307
https://doi.org/10.1016/s0166-218x(01)00275-x
https://hdl.handle.net/11697/9293
https://doi.org/doi:10.1016/S0166-218X(01)00275-X
http://www.sciencedirect.com/science/article/pii/S0166218X0100275X

On the Complexity of Familiar Functions and Numbers

Authors: Borwein, J. M., Borwein, P. B.

Source: SIAM Review, 1988 Dec 01. 30(4), 589-601.

Access URL: https://www.jstor.org/stable/2030559

Complexity Approximation Principle: Complexity approximation principle

Authors: Vladimir Vovk, Alexander Gammerman

Source: The Computer Journal. 42:318-322

Subject Terms: minimum message length, complexity approximation principle, Kolmogorov complexity, 0102 computer and information sciences, 0101 mathematics, 01 natural sciences, Algorithmic information theory (Kolmogorov complexity, etc.), minimum description length

File Description: application/xml

On low-complexity approximation of matrices

Authors: Van der Veen, A.J. (author), Dewilde, P.M. (author)

Source: Linear Algebra and its Applications. :1145-1201

Subject Terms: low-complexity approximation of matrices, Numerical Analysis, Complexity and performance of numerical algorithms, Algebra and Number Theory, Other matrix algorithms, Discrete Mathematics and Combinatorics, matrix of lower computational complexity, Geometry and Topology, closed form solution, 0101 mathematics, 01 natural sciences

File Description: application/xml

Access URL: https://zbmath.org/614137
https://doi.org/10.1016/0024-3795(94)90383-2
http://resolver.tudelft.nl/uuid:e150e1ab-b545-4ba7-a24e-f154820326e9

Scheduling UET task systems with concurrency on two parallel identical processors

Authors: Brucker, Peter, Knust, Sigrid, Roper, Duncan, Zinder, Yakov

Source: Mathematical Methods of Operations Research. December 2000 52(3):369-387

On the complexity of Wafer-to-Wafer Integration

Authors: Duvillié, Guillerme, Bougeret, Marin, Boudet, Vincent, Dokka, Trivikram, Giroudeau, Rodolphe

Contributors: Methods, Algorithms for Operations REsearch (MAORE), Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM), Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS)-Université de Montpellier (UM)-Centre National de la Recherche Scientifique (CNRS), Operations Research and Business Statistics (ORSTAT), Catholic University of Leuven = Katholieke Universiteit Leuven (KU Leuven), LIRMM

Source: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01110027 ; [Research Report] LIRMM. 2015.

Subject Terms: ILP, FPT, Approximability, Wafer-to-Wafer Integration, Operational Research, Complexity & approximation, Complexity, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC], [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]

Availability: https://hal-lirmm.ccsd.cnrs.fr/lirmm-01110027
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01110027v1/document
https://hal-lirmm.ccsd.cnrs.fr/lirmm-01110027v1/file/main.pdf

Vehicle Sharing System Optimization: Scenario-based approach

Authors: Waserhole, Ariel, Jost, Vincent, Brauner, Nadia

Contributors: Recherche Opérationnelle pour les Systèmes de Production (G-SCOP_ROSP), Laboratoire des sciences pour la conception, l'optimisation et la production (G-SCOP), Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)-Université Joseph Fourier - Grenoble 1 (UJF)-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP)-Institut National Polytechnique de Grenoble (INPG)-Centre National de la Recherche Scientifique (CNRS)

Source: https://hal.science/hal-00727040 ; 2012.

Subject Terms: Pricing, Vehicle Sharing Systems, Scenario-based approach, Queuing network, Complexity & approximation, Revenue Management, Graph vertex pricing, [INFO.INFO-RO]Computer Science [cs]/Operations Research [math.OC]

Availability: https://hal.science/hal-00727040
https://hal.science/hal-00727040v4/document
https://hal.science/hal-00727040v4/file/Waserhole_VSS_ScenarioBasedApproach_May2013.pdf

A 'maximum node clustering' problem: A ``maximum node clustering'' problem

Authors: Giuliana Carello, Federico Della Croce, Andrea Grosso, Marco Locatelli 0001

Contributors: G., Carello, F., DELLA CROCE, A., Grosso, Locatelli, Marco

Source: Journal of Combinatorial Optimization.

Subject Terms: Combinatorial optimization, knapsack, Maximum Node Clustering - Knapsack - Complexity - Approximation, Graph algorithms (graph-theoretic aspects), maximum node clustering, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, Programming involving graphs or networks, Abstract computational complexity for mathematical programming problems, complexity, approximation, 01 natural sciences

File Description: application/xml; application/pdf

Access URL: http://hal.archives-ouvertes.fr/docs/00/11/57/74/PDF/AN4_5LAMSADE_107-119.pdf
https://hdl.handle.net/11583/1399404
https://doi.org/10.1007/s10878-006-8210-x
https://hdl.handle.net/11311/552922
http://www.springerlink.com/content/t2v2796u14803849/
https://doi.org/10.1007/s10878-006-8210-x