Library

Subject
Tags

1,152 matches · Complexity and Algorithms in Graphs

#
001A frugal primal-dual splitting with minimal lifting over arbitrary rooted treesOpenAlexPaperFeng Xue, Hui ZhangJul 21
002Finite-Moment Identifiability and Depth-Sensitive Recovery of Edge Failures from Boundary Heat ObservationsOpenAlexPaperAbraham RubinestockJul 20
003Machine-Checked Scalar Foundations for SGD AnalysisOpenAlexPaperTamás NagyJul 20
004Machine-Checked Scalar Foundations for SGD AnalysisOpenAlexPaperTamás NagyJul 20
005Bounded Fabrication and the Limits of Authenticity DetectionOpenAlexPaperT. S. EdenJul 19
006Bounded Fabrication and the Limits of Authenticity DetectionOpenAlexPaperT. S. EdenJul 19
007Finite-Moment Identifiability and Depth-Sensitive Recovery of Edge Failures from Boundary Heat ObservationsOpenAlexPaperAbraham RubinestockJul 19
008EML-AirComp: Layered Over-the-Air Computation from a Single Nomographic GateOpenAlexPaperOnur GünlüJul 17
009Uniform Row Sampling for Column Subset Selection: Sufficient Conditions Motivated by Problem 4.4OpenAlexPaperPeng QiJul 17
010Uniform Row Sampling for Column Subset Selection: Sufficient Conditions Motivated by Problem 4.4OpenAlexPaperPeng QiJul 17
011Revisiting column subset selection through the lens of submodularityOpenAlexPaperIlse C. F. Ipsen, Arvind K. SaibabaJul 15
012Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function ValuesOpenAlexPaperPhillip KergerJul 14
013Reproducing the k-copwin Algorithm: Theory vs. ImplementationOpenAlexPaperMeagan Mann, Christian Muise et al.Jul 14
014Anytime Analysis on BinVal: Adaptive Parameters HelpOpenAlexPaperTimo Kötzing, Jurek SanderJul 10
015Finding Simple Proofs for First-Order OptimizationOpenAlexPaperDaniel Berg Thomsen, Manu Upadhyaya et al.Jul 9
016Learning Unions of Intersecting Affine Modules in One Dimension with QueriesOpenAlexPaperEva González, Montserrat Hermo et al.Jul 9
017Towards Faster Feasible Matrix Multiplication by Trilinear AggregationOpenAlexPaperOded Schwartz, Eyal ZwecherJul 9
018Adversarial Robustness for Small Frequency Moments and a Weak Equivalence Theorem for Turnstile StreamsOpenAlexPaperElena Gribelyuk, Honghao Lin et al.Jul 7
019Edge Geography is XNLP-hard for Pathwidth and in XP for Tree-Partition WidthOpenAlexPaperThobias Kvalvik Høivik, Erlend Raa VågsetJul 3
020Query Complexity of Hypergraph Connectivity and Learnability using CUT OraclesOpenAlexPaperDeeparnab Chakrabarty, Hang LiaoJul 1
021Anti-Random Complexity Theory: A Unified Dual Reversal Framework of BPP via Measure-Generated Computation and Adversarial Path GeometryOpenAlexPaperJincheng ZhangJun 29
022Anti-Random Complexity Theory: A Unified Dual Reversal Framework of BPP via Measure-Generated Computation and Adversarial Path GeometryOpenAlexPaperJincheng ZhangJun 29
023Computing Lewis weights to high precision using local relative smoothnessOpenAlexPaperSander Gribling, Aaron Sidford et al.Jun 28
024Learning Unions of Intersecting Affine Modules in One Dimension with QueriesOpenAlexPaperEva González, Montserrat Hermo et al.Jun 27
025One Hex reduction to rule them all: Quoridor, Maze Attack, Pinko Pallino and Blockade are PSPACE-completeOpenAlexPaperFrancesco Carboni, Daniele MuscilloJun 27
026Provable Reductions in TFNPOpenAlexPaperNoah Fleming, Stefan Grosser et al.Jun 26
027Sharp First-Order Lower Bounds under Sublevel $α$-Polyak-Lojasiewicz ConditionsOpenAlexPaperSaeed Masiha, Negar Kiyavash et al.Jun 26
028A Solution to the Subset Sum Game ComplexityOpenAlexPaperhoussem drabliaJun 23
029A Solution to the Subset Sum Game ComplexityOpenAlexPaperhoussem drabliaJun 23
030Complexity of Clique-Guarded First-Order Logic with CountingOpenAlexPaperSteffen van Bergerem, Johannes Friedrich Lange et al.Jun 23
031Flood-It with Jewelry -- Characterizing the Game Complexity for Cograph GeneralizationsOpenAlexPaperMartin Darmüntzel, Christian Rosenke et al.Jun 22
032Representation-Sensitive Weihrauch Complexity in Tame Learning: Pair Homogeneity and DefinabilityOpenAlexPaperAlfredo Sepulveda-JimenezJun 22
033Representation-Sensitive Weihrauch Complexity in Tame Learning: Pair Homogeneity and DefinabilityOpenAlexPaperAlfredo Sepulveda-JimenezJun 22
034Representation-Sensitive Weihrauch Complexity in Tame Learning: Pair Homogeneity and DefinabilityOpenAlexPaperAlfredo Sepulveda-JimenezJun 22
035Representation-Sensitive Weihrauch Complexity in Tame Learning: Pair Homogeneity and DefinabilityOpenAlexPaperAlfredo Sepulveda-JimenezJun 22
036Withdrawal Notice: Appendix: Discreteness Arises Not from an Outer Bound but from Nodes — Discreteness as Nodes Generated by BinarityOpenAlexPaperNoriaki KiharaJun 19
037Appendix: Discreteness Arises Not from an Outer Bound but from Nodes — Discreteness as Nodes Generated by BinarityOpenAlexPaperNoriaki KiharaJun 18
038The Lagrangian Subspace Noise (LSN) Problem: papers, proofs, experiments, and implementationsOpenAlexPaperKwanghoo ChooJun 18
039The Lagrangian Subspace Noise (LSN) Problem: papers, proofs, experiments, and implementationsOpenAlexPaperChoo, KwanghooJun 17
040The Lagrangian Subspace Noise (LSN) Problem: papers, proofs, experiments, and implementationsOpenAlexPaperChoo, KwanghooJun 17
041The Lagrangian Subspace Noise (LSN) Problem: papers, proofs, experiments, and implementationsOpenAlexPaperChoo, KwanghooJun 17
042An Epistemic Analysis of Random Coordinated AttackOpenAlexPaperSophia Knight, David Lehnherr et al.Jun 16
043The Lagrangian Subspace Noise (LSN) Problem: papers, proofs, experiments, and implementationsOpenAlexPaperChoo, KwanghooJun 16
044The Lagrangian Subspace Noise (LSN) Problem: papers, proofs, experiments, and implementationsOpenAlexPaperChoo, KwanghooJun 15
045The Lagrangian Subspace Noise (LSN) Problem: papers, proofs, experiments, and implementationsOpenAlexPaperKwanghoo ChooJun 15
046The Lagrangian Subspace Noise (LSN) Problem: papers, proofs, experiments, and implementationsOpenAlexPaperChoo, KwanghooJun 15
047The Lagrangian Subspace Noise (LSN) Problem: papers, proofs, experiments, and implementationsOpenAlexPaperChoo, KwanghooJun 15
048Fourier Ratios of Graph Kernels: Energy Bounds, Optimal Labelings, and RecoveryOpenAlexPaperVishal Gupta, Alex IosevichJun 13
049Degree-Four Vector-Coordinate SoS Cannot Detect the MUB Upper BoundOpenAlexPaperShreyhaan SarkarJun 11
050Nearly Instance Optimal Sparse Matrix Approximation from Matrix-Vector ProductsOpenAlexPaperChristoper Musco, Indu RameshJun 10
051Improved Approximation Algorithms for Non-preemptive Throughput MaximizationOpenAlexPaperAlexander Armbruster, Fabrizio Grandoni et al.Jun 9
052On Parallel and Batch-Cutting Strategies for Norm-Minimization-Based Convex Vector OptimizationOpenAlexPaperMohammed AlshahraniJun 4
053On Interactions of Vapnik-Chervonenkis and Littlestone Dimensions with Logic and CombinatoricsOpenAlexPaperOlga Medrano Martín del CampoJun 1
054RGDBEK: Randomized Greedy Double Block Extended Kaczmarz Algorithm With Hybrid Parallel Implementation and ApplicationsOpenAlexPaperAneesh Panchal, Ratikanta BeheraJun 1
055pac-learning-lean: Formal PAC Learning Bounds in Lean 4OpenAlexPaperBen CassieJun 1
056pac-learning-lean: Formal PAC Learning Bounds in Lean 4OpenAlexPaperBen CassieJun 1
057Multi-iteration Stochastic OptimizersOpenAlexPaperAndré Gustavo Carlon, Luis Espath et al.May 29
058Spectral density estimation for normal matricesOpenAlexPaperCameron Musco, Christopher Musco et al.May 29
059The Mathematics of Large Language Models II: Concentration — A Depth Lower Bound for Robust ClassificationOpenAlexPaperMiquel Noguer AlonsoMay 29
060The Mathematics of Large Language Models II: Concentration — A Depth Lower Bound for Robust ClassificationOpenAlexPaperMiquel Noguer AlonsoMay 29

Showing 60 of 1,152 documents · scroll for more