No article text was recorded for this version.
high-degree polynomial complexity
Version 1 of 1304 papers310 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Obtaining a Proportional Allocation by Deleting Items
- Blog: Shortest odd paths in undirected graphs with conservative weight functions
- Blog: An FPRAS for #nFBDD
- Blog: A faster FPRAS for #NFA
- Blog: An FPRAS and Polynomial-Time Uniform Sampler for Tree Automata
- Blog: Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues
- Blog: Faster Binary Mean Computation Under Dynamic Time Warping
- Blog: Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning
- Blog: Complexity of Weighted First-Order Model Counting in the Two-Variable Fragment with Counting Quantifiers: A Bound to Beat
- Blog: Beyond Moments: Robustly Learning Affine Transformations with Asymptotically Optimal Error
- Blog: New Islands of Tractability of Cost-Optimal Planning
- Blog: A Unified Theory of Structural Tractability for Constraint Satisfaction and Spread Cut Decomposition
- Blog: Efficiently Testing Sparse GF(2) Polynomials
- Blog: Minimizing Total Calibration Cost
- Blog: Learning geometric concepts with nasty noise
- Blog: Adversarial Contextual Bandits Go Kernelized
- Blog: A combinatorial polynomial algorithm for the linear Arrow-Debreu market
- Blog: A PTAS for the Steiner Forest Problem in Doubling Metrics
- Blog: A Pseudopolynomial Algorithm for Alexandrov's Theorem
- Blog: A note on: No need to choose: How to get both a PTAS and Sublinear Query Complexity
- Blog: Range Concatenation Grammars for Translation
- Blog: Recognizing trace graphs of closed braids
- Blog: Differentially Private Algorithms for Learning Mixtures of Separated Gaussians
- Blog: Learning Probabilistic Read-once Formulas on Product Distributions
- Blog: The More, the Merrier: the Blessing of Dimensionality for Learning Large Gaussian Mixtures
- Blog: Throughput Maximization in the Speed-Scaling Setting
- Blog: On the Cryptographic Hardness of Learning Single Periodic Neurons
- Blog: Optimal Clustering with Noisy Queries via Multi-Armed Bandit
- Blog: An Algorithm for the Assignment Game Beyond Additive Valuations
- Blog: Approximate Counting of Linear Extensions in Practice
- Blog: k-Means has Polynomial Smoothed Complexity
- Blog: Deploying SDP for machine learning
- Blog: Statistically Efficient, Polynomial-Time Algorithms for Combinatorial Semi-Bandits
- Blog: Minimum Spanning Trees, Perfect Matchings and Cycle Covers Over Stochastic Points in Metric Spaces
- Blog: Hierarchical Matching of Deformable Shapes
- Blog: Sample-efficient Multiclass Calibration under ℓp Error
- Blog: The Alternation Hierarchy of First-Order Logic on Words is Decidable
- Blog: Conditional Linear Regression for Heterogeneous Covariances
- Blog: Circular Networks from Distorted Metrics
- Blog: Evaluating a quantum-classical quantum Monte Carlo algorithm with Matchgate shadows
- Blog: Geometric Computations on Indecisive and Uncertain Points
- Blog: PAC-learning bounded tree-width Graphical Models
- Blog: An FPRAS for Model Counting for Non-Deterministic Read-Once Branching Programs
- Blog: Isotropy and Log-Concave Polynomials: Accelerated Sampling and High-Precision Counting of Matroid Bases
- Blog: On Reconstructing a Hidden Permutation
- Blog: Approximation algorithms for Euler genus and related problems
- Blog: Differentially Private Data Releasing for Smooth Queries
- Blog: Tight Vector Bin Packing with Few Small Items via Fast Exact Matching in Multigraphs
- Blog: New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling
- Blog: Uniqueness of Tensor Decompositions with Applications to Polynomial Identifiability
- Blog: A Lottery Model for Center-Type Problems With Outliers
- Blog: Constraint Satisfaction and Fair Multi-Objective Optimization Problems: Foundations, Complexity, and Islands of Tractability
- Blog: Clustering High Dimensional Dynamic Data Streams
- Blog: Balancing Flow Time and Energy Consumption
- Blog: Multidimensional Dynamic Pricing for Welfare Maximization
- Blog: Faster Fréchet Distance Under Transformations
- Blog: EFQ: Why-Not Answer Polynomials in Action
- Blog: Greedy Adversarial Equilibrium: An Efficient Alternative to\n Nonconvex-Nonconcave Min-Max Optimization
- Blog: Improved Multi-Objective Particle Swarm Optimization Algorithm Based on Area Division With Application in Multi-UAV Task Assignment
- Blog: A Kernel for Multi-Parameter Persistent Homology
Showing 60 of 304 papers.
History & citation
Current · Permanent link
- Practical Efficiency for High Degree Polynomial Algorithms merged into this direction (69% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_high_degree_polynomial_complexity_d022c87e,
title = {high-degree polynomial complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/high-degree-polynomial-complexity/rdr_d022c87e2e6b413996f96ed326b3c6de},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_high_degree_polynomial_complexity_d022c87e_v1,
title = {high-degree polynomial complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/high-degree-polynomial-complexity/rdr_d022c87e2e6b413996f96ed326b3c6de/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}