Results 21 to 30 of about 1,745,964 (294)
Complexity of atoms, combinatorially [PDF]
Information Processing Letters, 2016 Atoms of a (regular) language $L$ were introduced by Brzozowski and Tamm in 2011 as intersections of complemented and uncomplemented quotients of $L$. They derived tight upper bounds on the complexity of atoms in 2013. In 2014, Brzozowski and Davies characterized the regular languages meeting these bounds.
openaire +3 more sources
Governing Complexity in World Politics
, 2021 Complexity is the new global ontology for world politics. This article summarizes the characteristics of complexity and its implications for informed US state policy making.
Western, Jon, Haas, Peter M
core +1 more source
On a hierarchy of Booleanfunctions hard to compute in constant depth [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 Any attempt to find connections between mathematical properties and complexity has a strong relevance to the field of Complexity Theory. This is due to the lack of mathematical techniques to prove lower bounds for general models of computation. This
Anna Bernasconi
doaj +2 more sources
Permutation Complexity Related to the Letter Doubling Map [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Given a countable set X (usually taken to be the natural numbers or integers), an infinite permutation, π, of X is a linear ordering of X. This paper investigates the combinatorial complexity of infinite permutations on the natural numbers associated ...
Steven Widmer
doaj +1 more source
A framework for mapping, visualisation and automatic model creation of signal‐transduction networks
Molecular Systems Biology, 2012 Intracellular signalling systems are highly complex. This complexity makes handling, analysis and visualisation of available knowledge a major challenge in current signalling research.
Carl‐Fredrik Tiger +7 more
doaj +1 more source
Tạp chí Khoa học Đại học Đà Lạt, 2017 The Traveling Salesman Problem (TSP) is the most prominent of the combinatorial optimization problems that belongs to NP-Hard. The best algorithm for solving TSP is the branch-bound algorithm with exponential-time complexity.
Đỗ Như An
doaj +1 more source
Neurocognitive mechanisms for processing inflectional and derivational complexity in English [PDF]
Psihologija, 2013 In the current paper we discuss the mechanisms that underlie the processing of inflectional and derivational complexity in English. We address this issue from a neurocognitive perspective and present evidence from a new fMRI study that the two ...
Božić Mirjana +1 more
doaj +1 more source
The inverse k-max combinatorial optimization problem [PDF]
Yugoslav Journal of Operations Research, 2023 Classical combinatorial optimization concerns finding a feasible subset of a ground set in order to optimize an objective function. We address in this article the inverse optimization problem with the k-max function. In other words, we attempt to perturb
Nhan Tran Hoai Ngoc +3 more
doaj +1 more source
Learning Combinatorial Optimization on Graphs: A Survey With Applications to Networking
IEEE Access, 2020 Existing approaches to solving combinatorial optimization problems on graphs suffer from the need to engineer each problem algorithmically, with practical problems recurring in many instances.
Natalia Vesselinova +3 more
doaj +1 more source
Combinatorial Complexes: Bridging the Gap Between Cell Complexes and Hypergraphs [PDF]
2023 57th Asilomar Conference on Signals, Systems, and Computers, 2023 Graph-based signal processing techniques have become essential for handling data in non-Euclidean spaces. However, there is a growing awareness that these graph models might need to be expanded into `higher-order' domains to effectively represent the complex relations found in high-dimensional data.
Mustafa Hajij +5 more
openaire +5 more sources