• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 105,122
Next 10 →

EXPOSE: Inferring Worst-case Time Complexity by Automatic Empirical Study

by unknown authors
"... Introduction to doubling. A useful understanding of an algorithm’s efficiency, the worst-case time complexity gives an upper bound on how an increase in the size of the input, denoted n, increases the execution time of the algo-rithm, or f(n). This relationship is often expressed in the ..."
Abstract - Add to MetaCart
Introduction to doubling. A useful understanding of an algorithm’s efficiency, the worst-case time complexity gives an upper bound on how an increase in the size of the input, denoted n, increases the execution time of the algo-rithm, or f(n). This relationship is often expressed in the

The worst-case time complexity for generating all maximal cliques, COCOON

by Etsuji Tomita , Akira Tanaka , Haruhisa Takahashi - Lecture Notes in Computer Science, , 2004
"... Abstract We present a depth-first search algorithm for generating all maximal cliques of an undirected graph, in which pruning methods are employed as in the Bron-Kerbosch algorithm. All the maximal cliques generated are output in a tree-like form. Subsequently, we prove that its worst-case time co ..."
Abstract - Cited by 82 (1 self) - Add to MetaCart
Abstract We present a depth-first search algorithm for generating all maximal cliques of an undirected graph, in which pruning methods are employed as in the Bron-Kerbosch algorithm. All the maximal cliques generated are output in a tree-like form. Subsequently, we prove that its worst-case time

Worst-case time complexity of a lattice formation problem

by Ketan Savla, Francesco Bullo
"... Abstract — We consider a formation control problem for a robotic network with limited communication and controlled motion abilities. We propose a novel control structure that organizes the robots in concentric layers and that associates to each layer a local leader. Through a load balancing algorith ..."
Abstract - Add to MetaCart
algorithm on the asynchronous network of layers we allocate the desired number of robots on each layer. A final uniform spreading algorithm leads the robots to a lattice-like formation. This novel distributed communication and control algorithm runs in linear time in the worst case. I.

A discrete subexponential algorithm for parity games

by Henrik Björklund, Sven Sandberg, Sergei Vorobyov - STACS’03 , 2003
"... We suggest a new randomized algorithm for solving parity games with worst case time complexity roughly ..."
Abstract - Cited by 36 (8 self) - Add to MetaCart
We suggest a new randomized algorithm for solving parity games with worst case time complexity roughly

Complexity of finding embeddings in a k-tree

by Stefan Arnborg, Derek G. Corneil , Andrzej Proskurowski - SIAM JOURNAL OF DISCRETE MATHEMATICS , 1987
"... A k-tree is a graph that can be reduced to the k-complete graph by a sequence of removals of a degree k vertex with completely connected neighbors. We address the problem of determining whether a graph is a partial graph of a k-tree. This problem is motivated by the existence of polynomial time al ..."
Abstract - Cited by 386 (1 self) - Add to MetaCart
status of two problems related to finding the smallest number k such that a given graph is a partial k-tree. First, the corresponding decision problem is NP-complete. Second, for a fixed (predetermined) value of k, we present an algorithm with polynomially bounded (but exponential in k) worst case time

Q : Worst-case Fair Weighted Fair Queueing

by Jon Bennett, Jon C. R, Bennett Hui Zhang
"... The Generalized Processor Sharing (GPS) discipline is proven to have two desirable properties: (a) it can provide an end-to-end bounded-delay service to a session whose traffic is constrained by a leaky bucket; (b) it can ensure fair allocation of bandwidth among all backlogged sessions regardless o ..."
Abstract - Cited by 365 (11 self) - Add to MetaCart
transmission time of that provided by GPS. In this paper, we will show that, contrary to pop...

© 1996 Springer-Verlag New York Inc. A Mildly Exponential Approximation Algorithm for the Permanent

by M. Jerrum, U. Vazirani
"... Abstract. A new approximation algorithm for the permanent of an n × n 0,1-matrix is presented. The algorithm is shown to have worst-case time complexity exp(O(n 1/2 log 2 n)). Asymptotically, this represents a considerable improvement over the best existing algorithm, which has worst-case time compl ..."
Abstract - Add to MetaCart
Abstract. A new approximation algorithm for the permanent of an n × n 0,1-matrix is presented. The algorithm is shown to have worst-case time complexity exp(O(n 1/2 log 2 n)). Asymptotically, this represents a considerable improvement over the best existing algorithm, which has worst-case time

Arbitrary-Precision Division

by Rod Howell Kansas, Rod Howell, For Some
"... This paper presents an algorithm for arbitrary-precision division and shows its worst-case time complexity to be related by a constant factor to that of arbitrary-precision multiplication. The material is adapted from [1], pp. 264, 295-297, where S. A. Cook is credited for suggesting the basic idea. ..."
Abstract - Add to MetaCart
This paper presents an algorithm for arbitrary-precision division and shows its worst-case time complexity to be related by a constant factor to that of arbitrary-precision multiplication. The material is adapted from [1], pp. 264, 295-297, where S. A. Cook is credited for suggesting the basic idea

The complexity of theorem-proving procedures

by Stephen A. Cook - IN STOC , 1971
"... It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved deterministi ..."
Abstract - Cited by 1050 (5 self) - Add to MetaCart
It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved

Quantum complexity theory

by Ethan Bernstein, Umesh Vazirani - in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM , 1993
"... Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This constructi ..."
Abstract - Cited by 574 (5 self) - Add to MetaCart
the modern (complexity theoretic) formulation of the Church–Turing thesis. We show the existence of a problem, relative to an oracle, that can be solved in polynomial time on a quantum Turing machine, but requires superpolynomial time on a bounded-error probabilistic Turing machine, and thus not in the class
Next 10 →
Results 1 - 10 of 105,122
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University