Complexity of adaptive testing in scenarios defined extensionally
Fuente:
arXiv
Saved in:
| Main Authors: | Rodriguez, Ismael, Rubio, David, Rubio, Fernando |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Complexity analysis and practical resolution of the data classification problem with private characteristics
by: Pantoja, David, et al.
Published: (2026)
by: Pantoja, David, et al.
Published: (2026)
Some conditions implying if P=NP then P=PSPACE
by: Rodriguez, Ismael
Published: (2026)
by: Rodriguez, Ismael
Published: (2026)
Direct Product Theorems for Randomized Query Complexity
by: Ben-David, Shalev, et al.
Published: (2025)
by: Ben-David, Shalev, et al.
Published: (2025)
Oracle separation of QMA and QCMA with bounded adaptivity
by: Ben-David, Shalev, et al.
Published: (2024)
by: Ben-David, Shalev, et al.
Published: (2024)
Structure in Communication Complexity and Constant-Cost Complexity Classes
by: Hatami, Hamed, et al.
Published: (2024)
by: Hatami, Hamed, et al.
Published: (2024)
From Proof Complexity to Circuit Complexity via Interactive Protocols
by: Arteche, Noel, et al.
Published: (2024)
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)
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)
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)
by: Przybyłek, Michał R., et al.
Published: (2026)
The Complexity of Tensor Rank
by: Schaefer, Marcus, et al.
Published: (2016)
by: Schaefer, Marcus, et al.
Published: (2016)
Pseudodeterministic Communication Complexity
by: Göös, Mika, et al.
Published: (2025)
by: Göös, Mika, et al.
Published: (2025)
Query Complexity with Unknowns
by: Mande, Nikhil S., et al.
Published: (2024)
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)
by: Nalli, Sai Soumya, et al.
Published: (2026)
On the power of adaption and randomization
by: Krieg, David, et al.
Published: (2024)
by: Krieg, David, et al.
Published: (2024)
The Radical Solution and Computational Complexity
by: Zheng, Bojin, et al.
Published: (2024)
by: Zheng, Bojin, et al.
Published: (2024)
The Computational Complexity of Factored Graphs
by: Gupta, Shreya, et al.
Published: (2024)
by: Gupta, Shreya, et al.
Published: (2024)
Separations in Proof Complexity and TFNP
by: Göös, Mika, et al.
Published: (2022)
by: Göös, Mika, et al.
Published: (2022)
Random Permutations in Computational Complexity
by: Hitchcock, John M., et al.
Published: (2025)
by: Hitchcock, John M., et al.
Published: (2025)
On the Complexity of Hazard-Free Formulas
by: Arazi, Leah London, et al.
Published: (2024)
by: Arazi, Leah London, et al.
Published: (2024)
Communication Complexity is NP-hard
by: Hirahara, Shuichi, et al.
Published: (2025)
by: Hirahara, Shuichi, et al.
Published: (2025)
The Complexity of Order-Finding for ROABPs
by: Bhargava, Vishwas, et al.
Published: (2024)
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)
by: Daghbouche, Karim
Published: (2025)
NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials
by: Baraskar, Omkar, et al.
Published: (2024)
by: Baraskar, Omkar, et al.
Published: (2024)
Properties of calculus in r-Complexity 2025
by: Folea, Rares, et al.
Published: (2026)
by: Folea, Rares, et al.
Published: (2026)
The Parameterized Complexity of Coloring Mixed Graphs
by: Lauerbach, Antonio, et al.
Published: (2026)
by: Lauerbach, Antonio, et al.
Published: (2026)
Hexasort -- The Complexity of Stacking Colors on Graphs
by: Klocker, Linus, et al.
Published: (2026)
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)
by: Abu-Khzam, Faisal N., et al.
Published: (2026)
Parameterized Complexity of the Star Decomposition Problem
by: Hajebi, Sahab, et al.
Published: (2024)
by: Hajebi, Sahab, et al.
Published: (2024)
On the Complexity of Claw-Free Vertex Splitting
by: Abu-Khzam, Faisal N., et al.
Published: (2025)
by: Abu-Khzam, Faisal N., et al.
Published: (2025)
An XOR Lemma for Deterministic Communication Complexity
by: Iyer, Siddharth, et al.
Published: (2024)
by: Iyer, Siddharth, et al.
Published: (2024)
On the Complexity of Problems on Tree-structured Graphs
by: Bodlaender, Hans L., et al.
Published: (2022)
by: Bodlaender, Hans L., et al.
Published: (2022)
On the Complexity of Combinatorial Optimization on Fixed Structures
by: Megiddo, Nimrod
Published: (2024)
by: Megiddo, Nimrod
Published: (2024)
Computational Complexity of Game Boy Games
by: Tirmazi, Hayder, et al.
Published: (2024)
by: Tirmazi, Hayder, et al.
Published: (2024)
Multiparty Communication Complexity of Collision Finding
by: Beame, Paul, et al.
Published: (2024)
by: Beame, Paul, et al.
Published: (2024)
A Note on the Complexity of Defensive Domination
by: Chaplick, Steven, et al.
Published: (2025)
by: Chaplick, Steven, et al.
Published: (2025)
Optimal Communication Complexity of Chained Index
by: Sundaresan, Janani
Published: (2024)
by: Sundaresan, Janani
Published: (2024)
Sensitivity and Query Complexity under Uncertainty
by: Benson, Deepu, et al.
Published: (2025)
by: Benson, Deepu, et al.
Published: (2025)
A Hierarchy for Constant Communication Complexity
by: Ambainis, Andris, et al.
Published: (2025)
by: Ambainis, Andris, et al.
Published: (2025)
The Zeta ($ζ$) Notation for Complex Asymptotes
by: Dutta, Anurag, et al.
Published: (2023)
by: Dutta, Anurag, et al.
Published: (2023)
Nearest Neighbor Complexity and Boolean Circuits
by: DiCicco, Mason, et al.
Published: (2024)
by: DiCicco, Mason, et al.
Published: (2024)
Similar Items
-
Complexity analysis and practical resolution of the data classification problem with private characteristics
by: Pantoja, David, et al.
Published: (2026) -
Some conditions implying if P=NP then P=PSPACE
by: Rodriguez, Ismael
Published: (2026) -
Direct Product Theorems for Randomized Query Complexity
by: Ben-David, Shalev, et al.
Published: (2025) -
Oracle separation of QMA and QCMA with bounded adaptivity
by: Ben-David, Shalev, et al.
Published: (2024) -
Structure in Communication Complexity and Constant-Cost Complexity Classes
by: Hatami, Hamed, et al.
Published: (2024)