scispace - formally typeset

Time complexity

About: Time complexity is a(n) research topic. Over the lifetime, 36062 publication(s) have been published within this topic receiving 879522 citation(s). more


Open accessJournal ArticleDOI: 10.1109/TC.1986.1676819
Bryant1Institutions (1)
Abstract: In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on the ordering of decision variables in the graph. Although a function requires, in the worst case, a graph of size exponential in the number of arguments, many of the functions encountered in typical applications have a more reasonable representation. Our algorithms have time complexity proportional to the sizes of the graphs being operated on, and hence are quite efficient as long as the graphs do not grow too large. We present experimental results from applying these algorithms to problems in logic design verification that demonstrate the practicality of our approach. more

Topics: And-inverter graph (65%), Pathwidth (65%), Implicit graph (65%) more

8,721 Citations

Open accessJournal ArticleDOI: 10.1103/PHYSREVE.70.066111
06 Dec 2004-Physical Review E
Abstract: The discovery and analysis of community structure in networks is a topic of considerable recent interest within the physics community, but most methods proposed so far are unsuitable for very large networks because of their computational cost. Here we present a hierarchical agglomeration algorithm for detecting community structure which is faster than many competing algorithms: its running time on a network with n vertices and m edges is O (md log n) where d is the depth of the dendrogram describing the community structure. Many real-world networks are sparse and hierarchical, with m approximately n and d approximately log n, in which case our algorithm runs in essentially linear time, O (n log(2) n). As an example of the application of this algorithm we use it to analyze a network of items for sale on the web site of a large on-line retailer, items in the network being linked if they are frequently purchased by the same buyer. The network has more than 400 000 vertices and 2 x 10(6) edges. We show that our algorithm can extract meaningful communities from this network, revealing large-scale patterns present in the purchasing habits of customers. more

5,826 Citations

Journal ArticleDOI: 10.1109/TSE.1976.233837
Thomas J. McCabe1Institutions (1)
Abstract: This paper describes a graph-theoretic complexity measure and illustrates how it can be used to manage and control program complexity. The paper first explains how the graph-theory concepts apply and gives an intuitive explanation of the graph concepts in programming terms. The control graphs of several actual Fortran programs are then presented to illustrate the correlation between intuitive complexity and the graph-theoretic complexity. Several properties of the graph-theoretic complexity are then proved which show, for example, that complexity is independent of physical size (adding or subtracting functional statements leaves complexity unchanged) and complexity depends only on the decision structure of a program. more

Topics: Worst-case complexity (70%), Game complexity (67%), Descriptive complexity theory (67%) more

4,749 Citations

Journal ArticleDOI: 10.1007/BF02579150
Narendra Karmarkar1Institutions (1)
01 Dec 1984-Combinatorica
Abstract: We present a new polynomial-time algorithm for linear programming. In the worst case, the algorithm requiresO(n 3.5 L) arithmetic operations onO(L) bit numbers, wheren is the number of variables andL is the number of bits in the input. The running-time of this algorithm is better than the ellipsoid algorithm by a factor ofO(n 2.5). We prove that given a polytopeP and a strictly interior point a eP, there is a projective transformation of the space that mapsP, a toP′, a′ having the following property. The ratio of the radius of the smallest sphere with center a′, containingP′ to the radius of the largest sphere with center a′ contained inP′ isO(n). The algorithm consists of repeated application of such projective transformations each followed by optimization over an inscribed sphere to create a sequence of points which converges to the optimal solution in polynomial time. more

Topics: Criss-cross algorithm (62%), Simplex algorithm (61%), Karmarkar's algorithm (58%) more

4,720 Citations

Open accessBook
01 Jan 1988-
Abstract: This book develops geometric techniques for proving the polynomial time solvability of problems in convexity theory, geometry, and - in particular - combinatorial optimization. It offers a unifying approach based on two fundamental geometric algorithms: - the ellipsoid method for finding a point in a convex set and - the basis reduction method for point lattices. The ellipsoid method was used by Khachiyan to show the polynomial time solvability of linear programming. The basis reduction method yields a polynomial time procedure for certain diophantine approximation problems. A combination of these techniques makes it possible to show the polynomial time solvability of many questions concerning poyhedra - for instance, of linear programming problems having possibly exponentially many inequalities. Utilizing results from polyhedral combinatorics, it provides short proofs of the poynomial time solvability of many combinatiorial optimization problems. For a number of these problems, the geometric algorithms discussed in this book are the only techniques known to derive polynomial time solvability. This book is a continuation and extension of previous research of the authors for which they received the Fulkerson Prize, awarded by the Mathematical Programming Society and the American Mathematical Society. more

Topics: Ellipsoid method (62%), Linear programming (58%), Combinatorial optimization (57%) more

3,634 Citations

No. of papers in the topic in previous years

Top Attributes

Show by:

Topic's top 5 most impactful authors

Gerhard J. Woeginger

65 papers, 1.7K citations

Saket Saurabh

35 papers, 903 citations

Fedor V. Fomin

32 papers, 494 citations

Rolf Niedermeier

29 papers, 546 citations

Jin-Yi Cai

28 papers, 602 citations

Network Information
Related Topics (5)
Approximation algorithm

23.9K papers, 654.3K citations

97% related
Randomized algorithm

4.5K papers, 146.7K citations

95% related
Directed graph

12.2K papers, 302.4K citations

94% related
Greedy algorithm

15.3K papers, 393.9K citations

93% related
Spanning tree

9.6K papers, 216.4K citations

93% related