Results 1  10
of
2,393,104
On Exponential Time Algorithm for kSAT
"... Abstract. In this work we present and analyze a simple algorithm for finding satisfying assignments of kCNF (Boolean formulae in conjunctive normal form with at most k literals per clause). Our work is motivated by a simple question: Are there any structural property of the kCNF which could help u ..."
Abstract
 Add to MetaCart
in the algorithm and reduce its time complexity. Our main lemma shows that the number of branches in a depth n decision tree for kCNF will be at least 2 n−
Exponential time algorithms for graph coloring
, 2011
"... Let [n] denote the set {1; : : : ; k}. A klabeling of vertices of a graph G(V;E) is a function V − → [k]. Given a klabeling, an edge is monochromatic if both its endpoints are assigned the same label. A klabeling is a kcoloring if no edge is monochromatic. The chromatic number of a graph is the ..."
Abstract
 Add to MetaCart
Let [n] denote the set {1; : : : ; k}. A klabeling of vertices of a graph G(V;E) is a function V − → [k]. Given a klabeling, an edge is monochromatic if both its endpoints are assigned the same label. A klabeling is a kcoloring if no edge is monochromatic. The chromatic number of a graph is the minimum k for which a kcoloring exists. Observe that in a kcoloring, every color class is an
An Improved Exponentialtime Algorithm for SAT
"... We propose and analyze a simple new algorithm for finding satisfying assignments of Boolean formulae in conjunctive normal form. The algorithm, ResolveSat, is a randomized variant of the DLL (Davis, Longeman and Loveland) [2] or DavisPutnam procedure. Rather than applying the DLL procedure to the i ..."
Abstract
 Add to MetaCart
We propose and analyze a simple new algorithm for finding satisfying assignments of Boolean formulae in conjunctive normal form. The algorithm, ResolveSat, is a randomized variant of the DLL (Davis, Longeman and Loveland) [2] or DavisPutnam procedure. Rather than applying the DLL procedure
An Improved Exponentialtime Algorithm for kSAT
, 1998
"... We propose and analyze a simple new randomized algorithm, called ResolveSat, for finding satisfying assignments of Boolean formulas in conjunctive normal form. The algorithm consists of two stages: a preprocessing stage in which resolution is applied to enlarge the set of clauses of the formula, ..."
Abstract

Cited by 116 (7 self)
 Add to MetaCart
, followed by a search stage that uses a simple randomized greedy procedure to look for a satisfying assignment. We show that, for each k, the running time of ResolveSat on a kCNF formula is significantly better than 2 n , even in the worst case. In particular, we show that the algorithm finds a
Exponential Time Algorithms: Structures, Measures, and Bounds
, 2008
"... This thesis studies exponential time algorithms, more precisely, algorithms exactly solving problems for which no polynomial time algorithm is known and likely to exist. Interested in worst–case upper bounds on the running times, several known techniques to design and analyze such algorithms are sur ..."
Abstract

Cited by 11 (7 self)
 Add to MetaCart
This thesis studies exponential time algorithms, more precisely, algorithms exactly solving problems for which no polynomial time algorithm is known and likely to exist. Interested in worst–case upper bounds on the running times, several known techniques to design and analyze such algorithms
Faster exponential time algorithms for the shortest vector problem
 ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY
, 2009
"... We present new faster algorithms for the exact solution of the shortest vector problem in arbitrary lattices. Our main result shows that the shortest vector in any ndimensional lattice can be found in time 2 3.199n and space 2 1.325n. This improves the best previously known algorithm by Ajtai, Kuma ..."
Abstract

Cited by 33 (3 self)
 Add to MetaCart
We present new faster algorithms for the exact solution of the shortest vector problem in arbitrary lattices. Our main result shows that the shortest vector in any ndimensional lattice can be found in time 2 3.199n and space 2 1.325n. This improves the best previously known algorithm by Ajtai
Exact exponentialtime algorithms for finding bicliques
, 2010
"... Due to a large number of applications, bicliques of graphs have been widely considered in the literature. This paper focuses on noninduced bicliques. Given a graph G = (V, E) on n vertices, a pair (X, Y), with X, Y ⊆ V, X ∩ Y = ∅, is a noninduced biclique if {x, y} ∈ E for any x ∈ X and y ∈ Y. Th ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
. The NPcomplete problem of finding a noninduced (k1, k2)biclique asks to decide whether G contains a noninduced biclique (X, Y) such that X  = k1 and Y  = k2. In this paper, we design a polynomialspace O(1.6914 n)time algorithm for this problem. It is based on an algorithm for bipartite graphs
An exact exponential time algorithm for counting bipartite cliques
"... We present a simple exact algorithm for counting bicliques of given size in a bipartite graph on n vertices. We achieve running time of O(1.2491 n), improving upon known exact algorithms for finding and counting bipartite cliques. ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We present a simple exact algorithm for counting bicliques of given size in a bipartite graph on n vertices. We achieve running time of O(1.2491 n), improving upon known exact algorithms for finding and counting bipartite cliques.
Results 1  10
of
2,393,104