Isbn: 9786134709293 - pseudo-polynomial time: computational complexity theory, time complexity, np-complete, np-hard (4 resultados)

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware 96 pp. Englisch.

Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computational complexity theory, a numeric algorithm runs in pseudo-polynomial time if its running time is polynomial in the numeric value of the input (which is exponential in the length of the input - its number of digits). An NP-complete problem with known pseudo-polynomial time algorithms is called weakly NP-complete. An NP-complete problem is called strongly NP-complete if it is proven that it cannot be solved by a pseudo-polynomial time algorithm unless P=NP. The strong/weak kinds of NP-hardness are defined analogously. Consider the problem of testing whether a number n is prime, by naively checking whether no number in {2,3., n/2} divides n evenly. This approach can take up to n/2-1 divisions, which is indeed linear in n but not in the size of n. For example, the number n = 2,000,000,000 would require approximately 1 billion divisions, even though the length of n is only 10 digits.…

Taschenbuch. Condición: Neu. Pseudo-Polynomial Time | Computational Complexity Theory, Time Complexity, NP-Complete, NP-Hard | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786134709293 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand. …

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, a numeric algorithm runs in pseudo-polynomial time ifits running time is polynomial in the numeric value of the input (whichis exponential in the length of the input - its number of digits). AnNP-complete problem with known pseudo-polynomial time algorithms iscalled weakly NP-complete. An NP-complete problem is called stronglyNP-complete if it is proven that it cannot be solved by apseudo-polynomial time algorithm unless P=NP. The strong/weak kinds ofNP-hardness are defined analogously. Consider the problem of testingwhether a number n is prime, by naively checking whether no number in{2,3., n/2} divides n evenly. This approach can take up to n/2-1divisions, which is indeed linear in n but not in the size of n. Forexample, the number n = 2,000,000,000 would require approximately 1billion divisions, even though the length of n is only 10 digits.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 96 pp. Englisch.…