• Suche: "algorithmic complexity"

Treffer 1 - 20 von 1.446

1

2024 Activity Report — Orpailleur Team (LORIA) : Knowledge Discovery and Knowledge Engineering
Couceiro, Miguel ; Pennerath, Frédéric ; Napoli, Amedeo ; et al.
LORIA UMR 7503 CNRS, INRIA, Université de LORRAINE. 2025

Knowledge discovery in d... pattern mining formal concept analysis knowledge engineering explainability algorithmic fairness …
Report
Zu den Favoriten
2

Eigenvalue Methods for Sparse Tropical Polynomial Systems
Akian, Marianne ; Béreau, Antoine ; Gaubert, Stéphane ; et al.

Durham, United Kingdom Tropical geometry Polynomial systems Zero-sum games Algorithmic complexity [MATH]Mathematics [math] …
Konferenz
Zu den Favoriten
3

Study of attractors complexity in cellular automata and the topological structure of Z^d-subshifts
Étude de la complexité des attracteurs dans les automates cellulaires et de la structure topologique des sous-décalages dans Z^d
Herrera Nunez, Alonso ; Institut de Mathématiques de Toulouse UMR5219 (IMT) ; Université Toulouse Capitole (UT Capitole) ; et al.
General Topology [math.GN]. Université de Toulouse; Pontificia universidad católica de Chile (Santiago de Chile), 2025. English. ⟨NNT : 2025TLSES071⟩

Topology Cellular automata Subshifts Dynamical systems Algorithmic complexity Attractors …
Dissertation
Zu den Favoriten
4

The Tropical Nullstellensatz and Positivstellensatz for Sparse Polynomial Systems
Akian, Marianne ; Béreau, Antoine ; Gaubert, Stéphane ; et al.
ISSAC 2023 - International Symposium on Symbolic and Algebraic Computation, Jul 2023, Tromsø, Norway. ⟨10.1145/3597066.3597089⟩

Tromsø, Norway Tropical geometry Polynomial systems Zero-sum games Algorithmic complexity [MATH]Mathematics [math]
Konferenz
Zu den Favoriten
5

McELIECE AND NIEDERREITER CRYPTOCODE STRUCTURE MODELS
Terra security; Vol. 1 No. 2 (2025): Terra Security; 81-88
Територія безпеки; Том 1 № 2 (2025): Територія безпеки; 81-88

модель model крипто-кодова конструкці... cybersecurity конфіденційність... algorithmic complexity …
Fachzeitschrift
Zu den Favoriten
6

The Maximum Zero-Sum Partition problem
Fertin, Guillaume ; Fontaine, Oscar ; Jean, Géraldine ; et al.
Theoretical Computer Science. 1019:114811-114811

Zero-sum Partition Algor... FPT Inapproximability Algorithmic complexity Partition Zero-sum …
Zeitschrift
Zu den Favoriten
7

2023 Activity Report -- Orpailleur Team (LORIA) : Knowledge Discovery and Knowledge Engineering
Napoli, Amedeo ; Blansché, Alexandre ; Boudjeloud-Assala, Lydia ; et al.
Université de Lorraine, CNRS, LORIA. 2024

Knowledge discovery in d... pattern mining formal concept analysis redescription mining knowledge engineering explainability …
Report
Zu den Favoriten
8

A Decision Support System For Early Stage Parkinson's Diagnosis from EEG Data Using Symbolic Mutual Information and KAC Features
Neslihan Baki ; Nurhan Gürsel Özmen
Sakarya Üniversitesi Fen Bilimleri Enstitüsü Dergisi, Vol 28, Iss 5, Pp 912-923 (2024)

weighted symbolic mutual... Chemistry parkinson extreme gradient boostin... TA1-2040 kolmogorov algorithmic c... …
Fachzeitschrift
Zu den Favoriten
9

On the hardness of determining the irregularity strength of graphs
Bensmail, Julien ; Combinatorics, Optimization and Algorithms for Telecommunications (COATI) ; Centre Inria d'Université Côte d'Azur ; et al.
Theoretical Computer Science. 937:96-107

detectable colouring graph labelling algorithmic complexity distant irregularity str... irregularity strength [INFO.INFO-DM]Computer S... …
Zeitschrift
Zu den Favoriten
10

Global complexity signatures of solar cycles: A unified Entropy-Fractal survey of OMNI solar wind data (1964–2025)
Sierra-Porta, D. ; Verdugo, Maximiliano Cañedo ; Herrera Acevedo, Daniel David
In Advances in Space Research 1 December 2025 76(11):7190-7204

Fachzeitschrift
Zu den Favoriten
11

Minimal algorithmic information loss methods for dimension reduction, feature selection and network sparsification
Zenil, Hector ; Kiani, Narsis A. ; Adams, Alyssa ; et al.
In Information Sciences December 2025 720

Fachzeitschrift
Zu den Favoriten
12

Highly-sensitive measure of complexity captures Boolean networks’ regimes and temporal order more optimally
de J. Luevano-Robledo, Manuel ; Puga-Candelas, Alejandro
In Physica D: Nonlinear Phenomena November 2025 482

Fachzeitschrift
Zu den Favoriten
13

The complexity dynamics of grokking
DeMoss, Branton ; Sapora, Silvia ; Foerster, Jakob ; et al.
In Physica D: Nonlinear Phenomena November 2025 482

Fachzeitschrift
Zu den Favoriten
14

Permutation Pattern Matching for Doubly Partially Ordered Patterns
Bulteau, Laurent ; Fertin, Guillaume ; Jugé, Vincent ; et al.
33rd Annual Symposium on Combinatorial Pattern Matching, Hideo Bannai and Jan Holub, Jun 2022, Prague, Czech Republic. ⟨10.4230/lipics.cpm.2022.21⟩

Prague, Czech Republic Parameterized Complexity Algorithmic Complexity Pattern Matching Permutations [INFO.INFO-DS]Computer S... …
Konferenz
Zu den Favoriten
15

A comparative evaluation of measures to assess randomness in human-generated sequences
Angelike, Tim ; Musch, Jochen
Behavior Research Methods. 56(7):7831-7848

Fachzeitschrift
Zu den Favoriten
16

Maximal universal width of an AFA is NP-hard
Alajaji, John ; Salomaa, Kai
In Theoretical Computer Science 11 August 2025 1045

Fachzeitschrift
Zu den Favoriten
17

Algorithmic aspects of peptide identification and protein inference by mass spectrometry
Aspects algorithmiques de l’identification de peptides et de l’inférence de protéines par spectrométrie de masse
Benoist, Emile ; Combinatoire et Bioinformatique (LS2N - équipe COMBI) ; Laboratoire des Sciences du Numérique de Nantes (LS2N) ; et al.
Bio-informatique [q-bio.QM]. Nantes Université, 2024. Français. ⟨NNT : ⟩

Proteomics Peptidomics Protein inference Peptide identification Mass spectrometry Algorithmic complexity …
Dissertation
Zu den Favoriten
18

Reachability in Two-Parametric Timed Automata with one Parameter is EXPSPACE-Complete
Göller, Stefan ; Hilaire, Mathieu ; Laboratoire Méthodes Formelles (LMF) ; et al.
Theory of Computing Systems. 68:900-985

Algorithmic Complexity Complexity Computability and Recurs... Computational Complexity Formal Languages and Aut... Theory of Computation …
Zeitschrift
Zu den Favoriten
19

Higher Social Choice
Macías Virgós, Enrique ; Pereira Sáez, María José ; Simón García, Ignacio ; et al.
Minerva. Repositorio Institucional de la Universidad de Santiago de Compostela
Universidad de Santiago de Compostela (USC)

Public Choice and Politi... Algebraic Topology Algorithmic Complexity Topology Social Choice and Welfar... Comparative Social Polic...
Fachzeitschrift
Zu den Favoriten
20

Formal Grammars Generating Fractal Descriptions of Molecular Structures
Longo S. ; Longo, S.
Complex Systems. 32:395-407

generative grammar fractal polycyclic alkanes algorithmic complexity molecular modeling L-system …
Fachzeitschrift
Zu den Favoriten
Suchwerkzeuge: RSS-Feed abonnieren Diese Suche als E-Mail versenden Suche speichern

Filter