Suchergebnisse - 68Q25: Analysis of algorithms AND problem complexity

NP-hardness of deciding convexity of quartic polynomials and related problems von Ahmadi, Amir Ali, Olshevsky, Alex, Parrilo, Pablo A., Tsitsiklis, John N.

“… ) is globally convex. This solves a problem that has been open since 1992 when N. Z. Shor asked for the complexity of deciding convexity for quartic polynomials …”
Volltext

(Re)packing Equal Disks into Rectangle von Fomin, Fedor V., Golovach, Petr A., Inamdar, Tanmay, Saurabh, Saket, Zehavi, Meirav

“… The problem of packing of equal disks (or circles) into a rectangle is a fundamental geometric problem …”
Volltext

Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization von Curtis, Frank E., O’Neill, Michael J., Robinson, Daniel P.

“… ) algorithm that has been designed for solving optimization problems involving a stochastic objective function and deterministic nonlinear equality constraints …”
Volltext

HODLR3D: hierarchical matrices for N-body problems in three dimensions von A, Kandappan V., Gujjula, Vaishnavi, Ambikasaran, Sivaram

“… This article introduces HODLR3D, a class of hierarchical matrices arising out of N -body problems in three dimensions …”
Volltext

Complexity of a projected Newton-CG method for optimization with bounds von Xie, Yue, Wright, Stephen J.

“… This paper describes a method for solving smooth nonconvex minimization problems subject to bound constraints with good worst-case complexity guarantees and practical performance …”
Volltext

A Lower Bound on the Complexity of Testing Grained Distributions von Goldreich, Oded, Ron, Dana

“… For a natural number m , a distribution is called m -grained, if each element appears with probability that is an integer multiple of 1 / m . We prove that, …”
Volltext

A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory von Cai, Jin-Yi, Fu, Zhiguo, Girstmair, Kurt, Kowalczyk, Michael

“… cannot be both rational multiples of π. We use this number theoretic result to prove a classification of the computational complexity of spin systems on k -regular graphs with general …”
Volltext

Diverse collections in matroids and graphs von Fomin, Fedor V., Golovach, Petr A., Panolan, Fahad, Philip, Geevarghese, Saurabh, Saket

“… We investigate the parameterized complexity of finding diverse sets of solutions to three fundamental combinatorial problems …”
Volltext

On a Hierarchy of Spectral Isomorphism Invariants von Arvind, V., Fuhlbrück, Frank, Köbler, Johannes, Verbitsky, Oleg

“… with the 2-dimensional Weisfeiler-Leman algorithm, extending the recent work of Rattan and Seppelt (SODA 2023). As another application of the characterization, we prove that almost …”
Volltext

A cost-scaling algorithm for computing the degree of determinants von Hirai, Hiroshi, Ikeda, Motoki

“… for t . This problem generalizes noncommutative Edmonds' problem and fundamental combinatorial optimization problems including the weighted linear matroid intersection problem …”
Volltext

Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond von Koiran, Pascal, Saha, Subhayan

“… We give a randomised algorithm for the following problem: If a homogeneous polynomial f ∈ K [ x 1 , . . . , x n ] (where K ⊆ C …”
Volltext

The Power of Natural Properties as Oracles von Impagliazzo, Russell, Kabanets, Valentine, Volkovich, Ilya

“… ) or its special case, the Minimal Circuit Size Problem (MCSP). We show that in a number of complexity-theoretic results that use the SAT oracle, one can use the MCSP oracle instead …”
Volltext

Subquadratic-Time Algorithms for Normal Bases von Giesbrecht, Mark, Jamshidpey, Armin, Schost, Éric

“… forms an F-basis of K. Such an α is called a normal element , and G · α is a normal basis . We introduce a probabilistic algorithm for testing whether a given …”
Volltext

A deterministic algorithm for the discrete logarithm problem in a semigroup von Tinani, Simran, Rosenthal, Joachim

“… The best general algorithms which solve this problem have a time complexity of and a space complexity of , where is the order of the group …”
Volltext

Low rank matrix completion by alternating steepest descent methods von Tanner, Jared, Wei, Ke

“… In this paper, we introduce an alternating steepest descent algorithm (ASD) and a scaled variant, ScaledASD, for the fixed-rank matrix completion problem …”
Volltext

Zeros and approximations of Holant polynomials on the complex plane von Casel, Katrin, Fischbeck, Philipp, Friedrich, Tobias, Göbel, Andreas, Lagodzinski, J. A. Gregor

“… small external field) and approximation algorithms for general Holant problems with small signature weights …”
Volltext

Rigid continuation paths II. structured polynomial systems von Bürgisser, Peter, Cucker, Felipe, Lairez, Pierre

“… This work studies the average complexity of solving structured polynomial systems that are characterised by a low evaluation cost, as opposed to the dense random model previously used …”
Volltext

On semiring complexity of Schur polynomials von Fomin, Sergey, Grigoriev, Dima, Nogneng, Dorian, Schost, Éric

“… Semiring complexity is the version of arithmetic circuit complexity that allows only two operations …”
Volltext

Euclidean TSP in Narrow Strips von Alkema, Henk, de Berg, Mark, van der Hofstad, Remco, Kisfaludi-Bak, Sándor

“… We investigate how the complexity of Euclidean TSP for point sets P inside the strip ( - ∞ , + ∞ ) × [ 0 , δ …”
Volltext

Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees von Lagarde, Guillaume, Limaye, Nutan, Srinivasan, Srikanth

“… . [Electronic Colloquium on Comput Complexity (ECCC) vol 23, no 94, 2016 ], who prove such a result …”
Volltext