A Probabilistic 3—SAT Algorithm Further Improved

Hofmeister, Thomas; Schöning, Uwe; Schuler, Rainer; Watanabe, Osamu

doi:10.1007/3-540-45841-7_15

Cited by 78 publications

(50 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The algorithm easily generalizes to the k-satisfiability problem, and yields a randomized exact algorithm with time complexity O * ((2(k − 1)/k) n ). The fastest known randomized exact algorithm for 3-satisfiability is due to Hofmeister, Schöning, Schuler & Watanabe [17], and has a running time of O * (1.3302 n ). It is based on a refinement of the above random walk algorithm.…”

Section: Exercise 61 For a Given Truth Assignment T And A Given Non-nmentioning

confidence: 99%

Exact Algorithms for NP-Hard Problems: A Survey

Woeginger

2003

Lecture Notes in Computer Science

499

271

View full text Add to dashboard Cite

Abstract. We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open problems in this area. The list of discussed NP-complete problems includes the travelling salesman problem, scheduling under precedence constraints, satisfiability, knapsack, graph coloring, independent sets in graphs, bandwidth of a graph, and many more.

show abstract

Section: Exercise 61 For a Given Truth Assignment T And A Given Non-nmentioning

confidence: 99%

Exact Algorithms for NP-Hard Problems: A Survey

Woeginger

2003

Lecture Notes in Computer Science

499

271

View full text Add to dashboard Cite

show abstract

“…Also in computer science, random walks have been applied to various problems such as 2-SAT, approximation of the permanent [10,11], and estimation of the volume of convex bodies [6]. Schöning's elegant algorithm for 3-SAT [15] and its improvement [9] are also based on classical random walks. Moreover, one of the most advantageous points of classical random walks as a useful algorithmic tool is that they use only simple local transitions to obtain global properties of the instance.…”

Section: Introductionmentioning

confidence: 99%

Analysis of absorbing times of quantum walks

2003

View full text Add to dashboard Cite

show abstract

“…In the same manner as our prior work [35,16] verifiable Computation notation were introduced and thus a notion of formalized verifiable Computation, which allows weak client to outsource the computation to the function of various dynamically-chosen inputs.…”

Section: International Journal Of Computer Applications (0975 -8887)mentioning

confidence: 99%

Enterprise Cloud Storage and Computation Security

Yadav¹,

Sharma²,

Sharma³

2015

IJCA

View full text Add to dashboard Cite

Cloud computing acts as a computing paradigm that aims to provide huge amount of computing in a fully virtualized manner by aggregating resources and thus offering a single system view. Cloud Computing is also delivered as utility assuring customized and quality of service guaranteed computation environments for cloud users. While an enterprise organization is composed of different departments like finance, admin etc these departments are segregated as sub network zone which are thus interconnected via network. Securities are essential for authorization of storage and computing. In this paper we have proposed a privacy cheating discouragement and computation auditing approach that bridging secure storage and computation auditing in cloud. Privacy cheating discouragement is designated by verifier signature, batch verification and probabilistic sampling techniques.

show abstract

A Probabilistic 3—SAT Algorithm Further Improved

Cited by 78 publications

References 5 publications

Exact Algorithms for NP-Hard Problems: A Survey

Exact Algorithms for NP-Hard Problems: A Survey

Analysis of absorbing times of quantum walks

Enterprise Cloud Storage and Computation Security

Contact Info

Product

Resources

About