Cover Image

Complexity analysis and practical resolution of the data classification problem with private characteristics

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Pantoja, David, Rodriguez, Ismael, Rubio, Fernando, Segura, Clara
Format:	Preprint
Published:	2026
Subjects:	Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Complexity of adaptive testing in scenarios defined extensionally
by: Rodriguez, Ismael, et al.
Published: (2026)

Some conditions implying if P=NP then P=PSPACE
by: Rodriguez, Ismael
Published: (2026)

Complexity classification of counting graph homomorphisms modulo a prime number
by: Bulatov, Andrei A., et al.
Published: (2021)

Efficient derandomization of differentially private counting queries
by: Ghentiyala, Surendra
Published: (2025)

Direct Product Theorems for Randomized Query Complexity
by: Ben-David, Shalev, et al.
Published: (2025)

Complexity of some algorithmic problems in groups: a survey
by: Shpilrain, Vladimir
Published: (2024)

Structure in Communication Complexity and Constant-Cost Complexity Classes
by: Hatami, Hamed, et al.
Published: (2024)

From Proof Complexity to Circuit Complexity via Interactive Protocols
by: Arteche, Noel, et al.
Published: (2024)

Average-Case Hardness of Binary-Encoded Clique in Proof and Communication Complexity
by: de Rezende, Susanna F., et al.
Published: (2026)

Complex Boolean Turing Machines: An Algebraic Semantic Framework for Computational Complexity
by: Zheng, Bojin, et al.
Published: (2026)

Information-Based Complexity vs Computational Complexity in Phaseless Polynomial Interpolation
by: Przybyłek, Michał R., et al.
Published: (2026)

The dihedral hidden subgroup problem
by: Chen, Imin, et al.
Published: (2021)

Constant-depth circuits for polynomial GCD over any characteristic
by: Bhattacharjee, Somnath, et al.
Published: (2025)

The Complexity of Tensor Rank
by: Schaefer, Marcus, et al.
Published: (2016)

Pseudodeterministic Communication Complexity
by: Göös, Mika, et al.
Published: (2025)

Query Complexity with Unknowns
by: Mande, Nikhil S., et al.
Published: (2024)

On Condensation of Block Sensitivity, Certificate Complexity and the $\mathsf{AND}$ (and $\mathsf{OR}$) Decision Tree Complexity
by: Nalli, Sai Soumya, et al.
Published: (2026)

On the approximability of graph visibility problems
by: Bilò, Davide, et al.
Published: (2024)

The Radical Solution and Computational Complexity
by: Zheng, Bojin, et al.
Published: (2024)

The Computational Complexity of Factored Graphs
by: Gupta, Shreya, et al.
Published: (2024)

Separations in Proof Complexity and TFNP
by: Göös, Mika, et al.
Published: (2022)

Random Permutations in Computational Complexity
by: Hitchcock, John M., et al.
Published: (2025)

On the Complexity of Hazard-Free Formulas
by: Arazi, Leah London, et al.
Published: (2024)

Communication Complexity is NP-hard
by: Hirahara, Shuichi, et al.
Published: (2025)

The Complexity of Order-Finding for ROABPs
by: Bhargava, Vishwas, et al.
Published: (2024)

Computational Complexity of UAP Reverse Engineering: A Formal Analysis of Automaton Identification and Data Complexity
by: Daghbouche, Karim
Published: (2025)

Properties of calculus in r-Complexity 2025
by: Folea, Rares, et al.
Published: (2026)

The Parameterized Complexity of Coloring Mixed Graphs
by: Lauerbach, Antonio, et al.
Published: (2026)

Hexasort -- The Complexity of Stacking Colors on Graphs
by: Klocker, Linus, et al.
Published: (2026)

On the Complexity of Vertex-Splitting Into an Interval Graph
by: Abu-Khzam, Faisal N., et al.
Published: (2026)

Parameterized Complexity of the Star Decomposition Problem
by: Hajebi, Sahab, et al.
Published: (2024)

On the Complexity of Claw-Free Vertex Splitting
by: Abu-Khzam, Faisal N., et al.
Published: (2025)

An XOR Lemma for Deterministic Communication Complexity
by: Iyer, Siddharth, et al.
Published: (2024)

On the Complexity of Problems on Tree-structured Graphs
by: Bodlaender, Hans L., et al.
Published: (2022)

On the Complexity of Combinatorial Optimization on Fixed Structures
by: Megiddo, Nimrod
Published: (2024)

Computational Complexity of Game Boy Games
by: Tirmazi, Hayder, et al.
Published: (2024)

Multiparty Communication Complexity of Collision Finding
by: Beame, Paul, et al.
Published: (2024)

A Note on the Complexity of Defensive Domination
by: Chaplick, Steven, et al.
Published: (2025)

Optimal Communication Complexity of Chained Index
by: Sundaresan, Janani
Published: (2024)

Sensitivity and Query Complexity under Uncertainty
by: Benson, Deepu, et al.
Published: (2025)