Order Retrieval in Compact Storage Systems
Fuente:
arXiv
Saved in:
| Main Authors: | Fliedner, Malte, Golak, Julian, Gül, Yağmur, Neumann, Simone |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
The Line Traveling Salesman and Repairman Problem with Collaboration
by: Golak, Julian, et al.
Published: (2025)
by: Golak, Julian, et al.
Published: (2025)
Termination of Real Linear Loops
by: Neumann, Eike, et al.
Published: (2026)
by: Neumann, Eike, et al.
Published: (2026)
The Complexity of Order-Finding for ROABPs
by: Bhargava, Vishwas, et al.
Published: (2024)
by: Bhargava, Vishwas, et al.
Published: (2024)
Transductive Learning Is Compact
by: Asilis, Julian, et al.
Published: (2024)
by: Asilis, Julian, et al.
Published: (2024)
On the Hardness of Order Finding and Equivalence Testing for ROABPs
by: Ramya, C., et al.
Published: (2025)
by: Ramya, C., et al.
Published: (2025)
Second-Order Parameterizations for the Complexity Theory of Integrable Functions
by: Bacho, Aras, et al.
Published: (2025)
by: Bacho, Aras, et al.
Published: (2025)
Retracted: Hadoop-Based Painting Resource Storage and Retrieval Platform Construction and Testing
by: Complexity
Published: (2024)
by: Complexity
Published: (2024)
Analogy between List Coloring Problems and the Interval $k$-$(γ,μ)$-choosability property: theoretical aspects of complexity
by: Gama, Simone Ingrid Monteiro, et al.
Published: (2025)
by: Gama, Simone Ingrid Monteiro, et al.
Published: (2025)
The Quantumly Fast and the Classically Forrious
by: Canonne, Clément L., et al.
Published: (2026)
by: Canonne, Clément L., et al.
Published: (2026)
MP-Aggregation MP(R,2-WO) is Polynomial-Time Solvable When the Output Should Be Dichotomous Weak Preference Order
by: Chen, Jiehua
Published: (2025)
by: Chen, Jiehua
Published: (2025)
On the Complexity of the Skolem Problem at Low Orders
by: Bacik, Piotr, et al.
Published: (2025)
by: Bacik, Piotr, et al.
Published: (2025)
The Role of Regularity in (Hyper-)Clique Detection and Implications for Optimizing Boolean CSPs
by: Fischer, Nick, et al.
Published: (2025)
by: Fischer, Nick, et al.
Published: (2025)
On the Complexity of p-Order Cone Programs
by: Blanco, Víctor, et al.
Published: (2025)
by: Blanco, Víctor, et al.
Published: (2025)
The Complexity and Expressive Power of Second-Order Extended Logic
by: Feng, Shiguang, et al.
Published: (2022)
by: Feng, Shiguang, et al.
Published: (2022)
On the enumeration of Tarski fixed points
by: Müller, Julian
Published: (2023)
by: Müller, Julian
Published: (2023)
Proof Systems Based on Structured Circuits
by: Micun, Matthäus, et al.
Published: (2026)
by: Micun, Matthäus, et al.
Published: (2026)
Two-State Spin Systems with Negative Interactions
by: Fei, Yumou, et al.
Published: (2023)
by: Fei, Yumou, et al.
Published: (2023)
Recursive Jump Operators and Optimal Proof Systems
by: Egidy, Fabian
Published: (2026)
by: Egidy, Fabian
Published: (2026)
Hard CNF Instances for Ideal Proof Systems
by: Hakoniemi, Tuomas, et al.
Published: (2026)
by: Hakoniemi, Tuomas, et al.
Published: (2026)
The SPARSE-Relativization Framework and Applications to Optimal Proof Systems
by: Egidy, Fabian
Published: (2026)
by: Egidy, Fabian
Published: (2026)
Optimal Proof Systems for Complex Sets are Hard to Find
by: Egidy, Fabian, et al.
Published: (2024)
by: Egidy, Fabian, et al.
Published: (2024)
A Lower Bound on Conservative Elementary Object Systems Coverability
by: Di Cosmo, Francesco, et al.
Published: (2025)
by: Di Cosmo, Francesco, et al.
Published: (2025)
Lower Bounds against the Ideal Proof System in Finite Fields
by: Elbaz, Tal, et al.
Published: (2025)
by: Elbaz, Tal, et al.
Published: (2025)
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets
by: Devillers, Raymond, et al.
Published: (2022)
by: Devillers, Raymond, et al.
Published: (2022)
A Characterization of Basic Feasible Functionals Through Higher-Order Rewriting and Tuple Interpretations
by: Baillot, Patrick, et al.
Published: (2024)
by: Baillot, Patrick, et al.
Published: (2024)
Symport/Antiport P Systems with Membrane Separation Characterize P^(#P)
by: Ducros, Vivien, et al.
Published: (2025)
by: Ducros, Vivien, et al.
Published: (2025)
A Critique of Lin's "On $\text{NP}$ versus $\text{coNP}$ and Frege Systems"
by: DeJesse, Nicholas, et al.
Published: (2025)
by: DeJesse, Nicholas, et al.
Published: (2025)
Group Order is in QCMA
by: Gall, François Le, et al.
Published: (2025)
by: Gall, François Le, et al.
Published: (2025)
Higher-Order Responsibility
by: Jiang, Junli, et al.
Published: (2025)
by: Jiang, Junli, et al.
Published: (2025)
The Round Complexity of Proofs in the Bounded Quantum Storage Model
by: Grilo, Alex B., et al.
Published: (2024)
by: Grilo, Alex B., et al.
Published: (2024)
Integration of Fractional Order Black-Scholes Merton with Neural Network
by: Maitra, Sarit, et al.
Published: (2023)
by: Maitra, Sarit, et al.
Published: (2023)
Encoding Co-Lex Orders of Finite-State Automata in Linear Space
by: Becker, Ruben, et al.
Published: (2025)
by: Becker, Ruben, et al.
Published: (2025)
Joint Optimization of Item and Pod Storage Assignment Problems with Picking Aisles’ Workload Balance in Robotic Mobile Fulfillment Systems
by: Jun Zhang, et al.
Published: (2024)
by: Jun Zhang, et al.
Published: (2024)
Systems of Discrete Differential Equations, Constructive Algebraicity of the Solutions
by: Notarantonio, Hadrien, et al.
Published: (2023)
by: Notarantonio, Hadrien, et al.
Published: (2023)
The Existential Theory of the Reals with Summation Operators
by: Bläser, Markus, et al.
Published: (2024)
by: Bläser, Markus, et al.
Published: (2024)
PFCS: Prime Factorization Cache System for Deterministic Data Relationship Discovery
by: Le, Duy
Published: (2025)
by: Le, Duy
Published: (2025)
The Power of Negation in Higher-Order Datalog
by: Charalambidis, Angelos, et al.
Published: (2025)
by: Charalambidis, Angelos, et al.
Published: (2025)
A Dividing Line for Structural Kernelization of Component Order Connectivity via Distance to Bounded Pathwidth
by: Greilhuber, Jakob, et al.
Published: (2026)
by: Greilhuber, Jakob, et al.
Published: (2026)
From Probability to Counterfactuals: the Increasing Complexity of Satisfiability in Pearl's Causal Hierarchy
by: Dörfler, Julian, et al.
Published: (2024)
by: Dörfler, Julian, et al.
Published: (2024)
On the Complexity of Identification in Linear Structural Causal Models
by: Dörfler, Julian, et al.
Published: (2024)
by: Dörfler, Julian, et al.
Published: (2024)
Similar Items
-
The Line Traveling Salesman and Repairman Problem with Collaboration
by: Golak, Julian, et al.
Published: (2025) -
Termination of Real Linear Loops
by: Neumann, Eike, et al.
Published: (2026) -
The Complexity of Order-Finding for ROABPs
by: Bhargava, Vishwas, et al.
Published: (2024) -
Transductive Learning Is Compact
by: Asilis, Julian, et al.
Published: (2024) -
On the Hardness of Order Finding and Equivalence Testing for ROABPs
by: Ramya, C., et al.
Published: (2025)