Cover Image

An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Agarwal, Pankaj K., Aronov, Boris, Ezra, Esther, Zahl, Joshua
Format:	Preprint
Published:	2018
Subjects:	Computational Geometry 68Q01, 68W01, 14Q20 F.2.2; I.3.5
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Murphys Laws of AI Alignment: Why the Gap Always Wins
by: Gaikwad, Madhava
Published: (2025)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
by: Sopp, Braeden, et al.
Published: (2026)

Achieving Tight $O(4^k)$ Runtime Bounds on Jump$_k$ by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
by: Opris, Andre, et al.
Published: (2024)

Shortest Paths in a Weighted Simplicial Complex
by: Chakraborty, Sukrit, et al.
Published: (2025)

Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
by: Golovach, Petr A., et al.
Published: (2022)

Runtime Analyses of NSGA-III on Many-Objective Problems
by: Opris, Andre, et al.
Published: (2024)

A First Runtime Analysis of the PAES-25: An Enhanced Variant of the Pareto Archived Evolution Strategy
by: Opris, Andre
Published: (2025)

Probabilistic Approach for Detection of High-Frequency Periodic Signals using an Event Camera
by: Ben-Ezra, David El-Chai, et al.
Published: (2022)

Abductive explanations of classifiers under constraints: Complexity and properties
by: Cooper, Martin, et al.
Published: (2024)

Frequency Principle: Fourier Analysis Sheds Light on Deep Neural Networks
by: Xu, Zhi-Qin John, et al.
Published: (2019)

Practical Quantum CIM Empowerment via All-Domestic-Core Agentic Large Model
by: Rui, Wang, et al.
Published: (2026)

Many Objective Problems Where Crossover is Provably Essential
by: Opris, Andre
Published: (2024)

Separate Before You Compress: The WWHO Tokenization Architecture
by: Darshana, Kusal
Published: (2026)

Online Decision Making with Generative Action Sets
by: Xu, Jianyu, et al.
Published: (2025)

Towards a Rigorous Understanding of the Population Dynamics of the NSGA-III: Tight Runtime Bounds
by: Opris, Andre
Published: (2025)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
by: DasGupta, Bhaskar, et al.
Published: (2026)

Data-Driven Animation Controller: A Prioritized Visual System for Decoupled Animation Logic in Godot Game Engine
by: TorabNezhad, Abtin, et al.
Published: (2026)

Phase Matching for a Generalized Grover's Algorithm
by: Cardullo, Chris, et al.
Published: (2026)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
by: Hougardy, Stefan, et al.
Published: (2025)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
by: Chen, Zongchen, et al.
Published: (2022)

Computing Maximal Repeating Subsequences in a String
by: Gong, Mingyang, et al.
Published: (2026)

Optimal Discretization is Fixed-parameter Tractable
by: Kratsch, Stefan, et al.
Published: (2020)

How to Compute a Moving Sum
by: Maslen, David K., et al.
Published: (2025)

Reasoning aligns language models to human cognition
by: Guiomar, Gonçalo, et al.
Published: (2026)

From Independence of Clones to Composition Consistency: A Hierarchy of Barriers to Strategic Nomination
by: Berker, Ratip Emin, et al.
Published: (2025)

Designing Rules to Pick a Rule: Aggregation by Consistency
by: Berker, Ratip Emin, et al.
Published: (2025)

Equi-affine minimal-degree moving frames for polynomial curves
by: Hong, Hoon, et al.
Published: (2024)

The Gallai Vertex Problem is $Θ_2^p$-Complete
by: Nikabadi, Amir, et al.
Published: (2026)

Polynomial Prenexing of QBFs with Non-Monotone Boolean Operators
by: Saffidine, Abdallah, et al.
Published: (2025)

On (In)approximability of MaxMin Independent Set Reconfiguration
by: Hoang, Hung P., et al.
Published: (2026)

Robust Bichromatic Classification using Two Lines
by: Glazenburg, Erwin, et al.
Published: (2024)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
by: Liu, Bowen
Published: (2025)

ETH-Tight Complexity of Optimal Morse Matching on Bounded-Treewidth Complexes
by: Philip, Geevarghese, et al.
Published: (2026)

Optimal phase change for a generalized Grover's algorithm
by: Cardullo, Christopher, et al.
Published: (2025)

Two-Robot Computational Landscape: A Complete Characterization of Model Power in Minimal Mobile Robot Systems
by: Kitamura, Naoki, et al.
Published: (2025)

Finding Cliques in Geometric Intersection Graphs with Grounded or Stabbed Constraints
by: Keil, J. Mark, et al.
Published: (2025)

Efficient Binary Decision Diagram Manipulation in External Memory
by: Sølvsten, Steffan Christ, et al.
Published: (2021)

A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences
by: Rahat, Md Tanzeem, et al.
Published: (2025)

Notes on Three Formulas of Abel
by: Cox, David A.
Published: (2024)

Probabilistic Computers (So Quantum Computers) Are More Rigorously Powerful Than Traditional Computers, and Derandomization
by: Lin, Tianrong
Published: (2023)