Imagen de Portada

The Stochastic Arrival Problem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Webster, Thomas
Formato:	Preprint
Publicado:	2022
Materias:	Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand
por: Caragiannis, Ioannis, et al.
Publicado: (2026)

On Computability of Computable Problems
por: Khaliq, Asad
Publicado: (2023)

The Greedy Coin Change Problem
por: Gupta, Shreya, et al.
Publicado: (2024)

On the Hardness of the Drone Delivery Problem
por: Bartlmae, Simon, et al.
Publicado: (2025)

Continuous Defensive Domination Problems
por: Grüne, Christoph, et al.
Publicado: (2026)

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

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

Reductions Between Code Equivalence Problems
por: Cheraghchi, Mahdi, et al.
Publicado: (2025)

Total Search Problems in $\mathsf{ZPP}$
por: Fleming, Noah, et al.
Publicado: (2025)

The 2-Attractor Problem is NP-Complete
por: Fuchs, Janosch, et al.
Publicado: (2023)

Inverse Intersections for Boolean Satisfiability Problems
por: Homer, Paul W.
Publicado: (2025)

On the Exact Matching Problem in Dense Graphs
por: Maalouly, Nicolas El, et al.
Publicado: (2024)

Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all $\ell_p$ Norms
por: Bennett, Huck, et al.
Publicado: (2022)

The Line Traveling Salesman and Repairman Problem with Collaboration
por: Golak, Julian, et al.
Publicado: (2025)

Maximum Matching and Related Problems in Catalytic Logspace
por: Chakraborty, Srijan, et al.
Publicado: (2026)

No Complete Problem for Constant-Cost Randomized Communication
por: Fang, Yuting, et al.
Publicado: (2024)

P-time Algorithms for Typical #EO Problems
por: Meng, Boning, et al.
Publicado: (2024)

Strong Inapproximability for a Promise Rank Problem
por: Guruswami, Venkatesan, et al.
Publicado: (2026)

Explaining the Ubiquity of Phase Transitions in Decision Problems
por: Jackson, Andrew
Publicado: (2025)

An Efficient Algorithm for Solving the 2-MAXSAT Problem
por: Chen, Yangjun
Publicado: (2023)

Geometry Of The Subset Sum Problem -- Part I
por: Bollepalli, Srinivas Balaji
Publicado: (2025)

Trading Determinism for Time: The k-Reach Problem
por: Bhadra, Ronak, et al.
Publicado: (2024)

Complexity Thresholds for the Constrained Colored Token Swapping Problem
por: Bilò, Davide, et al.
Publicado: (2026)

Feedback Set Problems on Bounded-Degree (Planar) Graphs
por: Bai, Tian, et al.
Publicado: (2026)

Boolean Circuit Complexity and Two-Dimensional Cover Problems
por: Cavalar, Bruno P., et al.
Publicado: (2025)

Worst-Case and Average-Case Hardness of Hypercycle and Database Problems
por: Fu, Cheng-Hao, et al.
Publicado: (2025)

Phase Transitions in Decision Problems Over Odd-Sized Alphabets
por: Jackson, Andrew
Publicado: (2025)

Limitations of Affine Integer Relaxations for Solving Constraint Satisfaction Problems
por: Lichter, Moritz, et al.
Publicado: (2024)

Limits of Sequential Local Algorithms on the Random $k$-XORSAT Problem
por: Yung, Kingsley
Publicado: (2024)

The First Known Problem That Is FPT with Respect to Node Scanwidth but Not Treewidth
por: Schestag, Jannik, et al.
Publicado: (2026)

Partial Minimum Branching Program Size Problem is ETH-hard
por: Glinskih, Ludmila, et al.
Publicado: (2024)

Parameterised Holant Problems
por: Aivasiliotis, Panagiotis, et al.
Publicado: (2024)

Stochastic thermodynamics of computation
por: Wolpert, David H.
Publicado: (2019)

Multicut Problems in Almost-Planar Graphs: The Dependency of Complexity on the Demand Pattern
por: Hörsch, Florian, et al.
Publicado: (2025)

Towards Solving NP-Complete and Other Hard Problems Efficiently in Practice
por: Digulescu, Mircea-Adrian
Publicado: (2026)

The Complexity of Promise Constraint Satisfaction Problem Seen from the Other Side
por: Asimi, Kristina, et al.
Publicado: (2024)

Hardness of the Binary Covering Radius Problem in Large $\ell_p$ Norms
por: Bennett, Huck, et al.
Publicado: (2026)

Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse
por: Jackiewicz, Marcel, et al.
Publicado: (2024)

The 2CNF Boolean Formula Satisfiability Problem and the Linear Space Hypothesis
por: Yamakami, Tomoyuki
Publicado: (2017)

The Complexity of Counting Turns in the Line-Based Dial-a-Ride Problem
por: Lauerbach, Antonio, et al.
Publicado: (2024)