Výsledky vyhledávání - 68q25: analysis of algorithms and problems complexity

NP-hardness of deciding convexity of quartic polynomials and related problems Autor 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…”
Získat plný text

(Re)packing Equal Disks into Rectangle Autor 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…”
Získat plný text

Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization Autor 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…”
Získat plný text

HODLR3D: hierarchical matrices for N-body problems in three dimensions Autor 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…”
Získat plný text

Complexity of a projected Newton-CG method for optimization with bounds Autor 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…”
Získat plný text

A Lower Bound on the Complexity of Testing Grained Distributions Autor 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,…”
Získat plný text

A Complexity Trichotomy for k-Regular Asymmetric Spin Systems Using Number Theory Autor 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…”
Získat plný text

Diverse collections in matroids and graphs Autor 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…”
Získat plný text

On a Hierarchy of Spectral Isomorphism Invariants Autor 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…”
Získat plný text

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

“… for t . This problem generalizes noncommutative Edmonds' problem and fundamental combinatorial optimization problems including the weighted linear matroid intersection problem…”
Získat plný text

Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond Autor 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…”
Získat plný text

The Power of Natural Properties as Oracles Autor 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…”
Získat plný text

Subquadratic-Time Algorithms for Normal Bases Autor 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…”
Získat plný text

A deterministic algorithm for the discrete logarithm problem in a semigroup Autor 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…”
Získat plný text

Low rank matrix completion by alternating steepest descent methods Autor 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…”
Získat plný text

Zeros and approximations of Holant polynomials on the complex plane Autor 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…”
Získat plný text

Rigid continuation paths II. structured polynomial systems Autor 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…”
Získat plný text

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

“…Semiring complexity is the version of arithmetic circuit complexity that allows only two operations…”
Získat plný text

Euclidean TSP in Narrow Strips Autor 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 , δ…”
Získat plný text

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

“… . [Electronic Colloquium on Comput Complexity (ECCC) vol 23, no 94, 2016 ], who prove such a result…”
Získat plný text