Search Results - 68q25 (theory of computing: analysis of algorithms and (problem OR problems) complexity)*

NP-hardness of deciding convexity of quartic polynomials and related problems by 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…”
Get full text

HODLR3D: hierarchical matrices for N-body problems in three dimensions by 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…”
Get full text

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

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

(Re)packing Equal Disks into Rectangle by 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…”
Get full text

Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond by 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…”
Get full text

The Efficient Computation of Aircraft Range Problem by Yu, Fang, Cui, Jin-chuan

“… The work is intended to fill the blank of computational complexity theory. We focus on the cluster structure of instance data of aircraft range problem…”
Get full text

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

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

Euclidean TSP in Narrow Strips by 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 , δ…”
Get full text

Graph cuts with interacting edge weights: examples, approximations, and algorithms by Jegelka, Stefanie, Bilmes, Jeff A.

“…”, for which we study complexity, algorithms, and connections to polymatroidal network flows. Finally, we compare the proposed algorithms empirically…”
Get full text

On complexity, representation and approximation of integral multicommodity flows by Srivastav, Anand, Stangier, Peter

“…) where m is the number of constraints (resp. the number of edges). In the complexity-theoretic part it is shown that the approximable instances above build hard problems…”
Get full text

On the complexity of computing Kronecker coefficients by Pak, Igor, Panova, Greta

“…We study the complexity of computing Kronecker coefficients g ( λ , μ , ν ) . We give explicit bounds in terms of the number of parts ℓ…”
Get full text

Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number by Misra, Pranabendu, Saurabh, Saket, Sharma, Roohani, Zehavi, Meirav

“… In this paper, we further strengthen this belief by showing that several cut problems that admit sub-exponential time parameterized algorithms…”
Get full text

An O(nlogn) Time Algorithm for Computing the Path-Length Distance Between Trees by Bryant, David, Scornavacca, Celine

“…Tree comparison metrics have proven to be an invaluable aide in the reconstruction and analysis of phylogenetic (evolutionary) trees…”
Get full text

Guess Free Maximization of Submodular and Linear Sums by Feldman, Moran

“… Recently, Sviridenko et al. (Math Oper Res 42(4):1197–1218, 2017) described an algorithm for this problem whose approximation guarantee is optimal in some intuitive and formal senses…”
Get full text

Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary by Haeser, Gabriel, Liu, Hongcheng, Ye, Yinyu

“… By exploiting an interior point technique, we present first- and second-order optimality conditions for this problem that reduces to classical ones when the derivative on the boundary is available…”
Get full text

Ultimate Greedy Approximation of Independent Sets in Subcubic Graphs by Krysta, Piotr, Mari, Mathieu, Zhi, Nan

“… We focus on the well known minimum-degree greedy algorithm for this problem. This algorithm iteratively chooses a minimum degree vertex in the graph, adds it to the solution and removes its neighbors, until the remaining graph is empty…”
Get full text

Operator Scaling: Theory and Applications by Garg, Ankit, Gurvits, Leonid, Oliveira, Rafael, Wigderson, Avi

“… in Comput Complex 26(3):717–763, 2017 ) (whether or not randomization is allowed). The algorithm efficiently solves the “word problem…”
Get full text

A General Purpose Algorithm for Counting Simple Cycles and Simple Paths of Any Length by Giscard, Pierre-Louis, Kriege, Nils, Wilson, Richard C.

“… and ω is the exponent of matrix multiplication. We compare the algorithm complexity both theoretically and experimentally with most of the existing algorithms for the same task…”
Get full text

Computational Complexity of Holant Problems by Cai, Jin-Yi, Lu, Pinyan, Xia, Mingji

“…We propose and explore a novel alternative framework to study the complexity of counting problems, called Holant problems…”
Get full text

Computing the Homology of Semialgebraic Sets. I: Lax Formulas by Bürgisser, Peter, Cucker, Felipe, Tonelli-Cueto, Josué

“… All previous algorithms solving this problem have doubly exponential complexity. Our algorithm thus represents an exponential acceleration over state-of-the-art algorithms…”
Get full text