Výsledky vyhľadávania - 68q25 (theory of computing: analysis of algorithms AND (problem OR 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ískať 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ískať 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ískať 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ískať 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ískať plný text

The Efficient Computation of Aircraft Range Problem Autor 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…”
Získať 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ískať 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ískať plný text

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

“…”, for which we study complexity, algorithms, and connections to polymatroidal network flows. Finally, we compare the proposed algorithms empirically…”
Získať plný text

On complexity, representation and approximation of integral multicommodity flows Autor 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…”
Získať plný text

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

“…We study the complexity of computing Kronecker coefficients g ( λ , μ , ν ) . We give explicit bounds in terms of the number of parts ℓ…”
Získať plný text

Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number Autor 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…”
Získať plný text

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

“…Tree comparison metrics have proven to be an invaluable aide in the reconstruction and analysis of phylogenetic (evolutionary) trees…”
Získať plný text

Guess Free Maximization of Submodular and Linear Sums Autor 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…”
Získať plný text

Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary Autor 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…”
Získať plný text

Ultimate Greedy Approximation of Independent Sets in Subcubic Graphs Autor 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…”
Získať plný text

Operator Scaling: Theory and Applications Autor 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…”
Získať plný text

A General Purpose Algorithm for Counting Simple Cycles and Simple Paths of Any Length Autor 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…”
Získať plný text

Computational Complexity of Holant Problems Autor 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…”
Získať plný text

Computing the Homology of Semialgebraic Sets. I: Lax Formulas Autor 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…”
Získať plný text