MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Worst-Case Upper Bounds." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

265 documents found, showing 1 through 10. Next 10 →

ATOM

New Worst-Case Upper Bounds for SAT
by Edward A. Hirsch, Recently Kullmann — 2000 — Journal of Automated Reasoning
…New Worst-Case Upper Bounds for SAT Edward A. Hirsch y Abstract In 1980 Monien and Speckenmeyer…
Cited by 34 (9 self) – Add To MetaCart

Worst-case upper bounds for SAT: automated proof
by Sergey I. Nikolenko, Aleksander V. Sirotkin — 2003 — In 15th European Summer School in Logic Language and Information (ESSLLI
…Worst-case upper bounds for SAT: automated proof Sergey I. Nikolenko Aleksander V. Sirotkin y…
Cited by 3 (0 self) – Add To MetaCart

New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT
by Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith — 2000
…New Worst-Case Upper Bounds for MAX-2-SAT with Application to MAX-CUT Jens Gramm a;1;2 Edward A…
Cited by 17 (8 self) – Add To MetaCart

Worst-Case Upper Bounds for MAX-2-SAT with an Application to MAX-CUT
by Jens Gramm, Edward A. Hirsch, Rolf Niedermeier, Peter Rossmanith — 2001
…Worst-Case Upper Bounds for MAX-2-SAT with an Application to MAX-CUT Jens Gramm a;1;2 Edward A…
Cited by 16 (2 self) – Add To MetaCart

Algorithms for SAT and Upper Bounds on Their Complexity
by Evgeny Dantsin, Edward Hirsch, Sergei Ivanov, Maxim Vsemirnov — 2001
… for the propositional satisability problem, in particular algorithms that have the best current worst-case upper bounds…
Cited by 7 (2 self) – Add To MetaCart

The Minimum Distance of Turbo-Like Codes
by Louay Bazzi, Mohammad Mahdian, Sanjoy Mitter, Daniel Spielman — 2001 — Online]. Available: http://www-math.mit.edu/ ∼ mahdian/tc3.ps
… Spielman Abstract We derive worst case upper bounds on the minimum distance of parallel concatenated…
Cited by 12 (0 self) – Add To MetaCart

New methods for 3-SAT decision and worst-case analysis
by O. Kullmann — 1998 — Theoretical Computer Science
…://mi.informatik.uni-frankfurt.de/people/kullmann/kullmann.html February 21, 1998 Abstract We prove the worst-case upper bound 1:5045 n for the time complexity of 3-SAT…
Cited by 49 (10 self) – Add To MetaCart

MAX-SAT for formulas with constant clause density can be solved faster than in O(2 n ) time
by Evgeny Dantsin, Er Wolpert — 2006 — In Proceedings of Conference on Theory and Applications of Satisfiability Testing, Springer LNCS 4121:266–276
…. Worst-case upper bounds for MAX-SAT less than O(2 n ) were previously known only for k-CNF formulas…
Cited by 3 (0 self) – Add To MetaCart

Constructing Automata from Temporal Logic Formulas: A Tutorial
by Pierre Wolper — Summer School on Trends in Computer Science, LNCS 2090
… to the worst-case upper bound. It then turns to the techniques that can be used to improve this algorithm…
Cited by 15 (0 self) – Add To MetaCart

A New Algorithm for MAX-2-SAT
by Edward A. Hirsch — 1999 — In Proceedings of 17th International Symposium on Theoretical Aspects of Computer Science, STACS 2000
… in proving (exponential-time) worst-case upper bounds for the propositional satisability problem (SAT). MAX…
Cited by 9 (3 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB