AI Chat AI Image Generator AI Video Text to Speech

Erdös-Szekeres Partitioning Problem

11/21/2020
∙
by   Michael Mitzenmacher, et al.
∙
0
∙

In this note, we present a substantial improvement on the computational complexity of the Erdös-Szekeres partitioning problem and review recent works on dynamic LIS.

READ FULL TEXT

page 1

page 2

page 3

page 4

Related Research

research
∙ 09/03/2019

Value-centric Dynamic Partial Order Reduction

The verification of concurrent programs remains an open challenge, as th...
0 Krishnendu Chatterjee, et al. ∙
research
∙ 12/29/2020

Quality-Driven Dynamic VVC Frame Partitioning for Efficient Parallel Processing

VVC is the next generation video coding standard, offering coding capabi...
0 Thomas Amestoy, et al. ∙
research
∙ 02/21/2016

Uniform Hypergraph Partitioning: Provable Tensor Methods and Sampling Techniques

In a series of recent works, we have generalised the consistency results...
0 Debarghya Ghoshdastidar, et al. ∙
research
∙ 12/12/2022

Minimum-weight partitioning of a set with associated subsets

The paper presents complexity results and performance guaranties for a f...
0 Yakov Zinder, et al. ∙
research
∙ 05/25/2023

UpMax: User partitioning for MaxSAT

It has been shown that Maximum Satisfiability (MaxSAT) problem instances...
0 Pedro Orvalho, et al. ∙
research
∙ 09/01/2020

Rank-one partitioning: formalization, illustrative examples, and a new cluster enhancing strategy

In this paper, we introduce and formalize a rank-one partitioning learni...
7 Charlotte Laclau, et al. ∙
research
∙ 04/04/2023

q-Partitioning Valuations: Exploring the Space Between Subadditive and Fractionally Subadditive Valuations

For a set M of m elements, we define a decreasing chain of classes of no...
0 Kiril Bangachev, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal