NL-Complete: Complexity Class, ST-Connectivity, Conjunctive Normal Form - Tapa blanda

NL-Complete

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In computationalcomplexity theory, NL-Complete is a complexity class which is completefor NL. It contains the most 'difficult' or 'expressive' problems in NL.If a method exists for solving any one of the NL-complete problems inlogarithmic memory space, then NL=L. One important NL-complete problemis ST-connectivity (or 'Reachability') (Papadimitriou 1994 Thrm. 16.2)the problem of determining whether, given a directed graph G and twonodes s and t on that graph, there is a path from s to t.ST-connectivity can be seen to be in NL, because we start at the node sand nondeterministically walk to every other reachable node.ST-connectivity can be seen to be NL-hard by considering the computationstate graph of any other NL algorithm, and considering that the otheralgorithm will accept if and only if there is a (nondetermistic) pathfrom the starting state to an accepting state.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 76 pp. Englisch. Nº de ref. del artículo: 9786131988691

Contactar al vendedor