Books on the topic 'Low computational complexity algorithms'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 books for your research on the topic 'Low computational complexity algorithms.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse books on a wide variety of disciplines and organise your bibliography correctly.
Kronsjö, Lydia. Computational complexity of sequential and parallel algorithms. Chichester: Wiley, 1985.
Find full textKronsjö, Lydia I. Computational complexity of sequential and parallel algorithms. Chichester: Wiley, 1986.
Find full textComputational complexity of sequential and parallel algorithms. Chichester: Wiley, 1987.
Find full textWilf, Herbert S. Algorithms and complexity. Englewood Cliffs, N.J: Prentice-Hall, 1986.
Find full textAlgorithms and complexity. 2nd ed. Natick, Mass: A.K. Peters, 2002.
Find full text1939-, Steiglitz Kenneth, ed. Combinatorial optimization: Algorithms and complexity. Mineola, N.Y: Dover Publications, 1998.
Find full textNeapolitan, Richard E. Foundations of algorithms. 4th ed. Sudbury, Mass: Jones and Bartlett Publishers, 2011.
Find full textKumarss, Naimipour, ed. Foundations of algorithms. 4th ed. Sudbury, Mass: Jones and Bartlett Publishers, 2011.
Find full textAlgorithms: Their complexity and efficiency. 2nd ed. Chichester: Wiley, 1987.
Find full textComplexity theory: Exploring the limits of efficient algorithms. Berlin: Springer, 2005.
Find full textCounting, sampling and integrating: Algorithms and complexity. Boston, MA: Birkhauser Verlag, 2003.
Find full textKumarss, Naimipour, ed. Foundations of algorithms using C++ pseudocode. 3rd ed. Sudbury, Mass: Jones and Bartlett, 2004.
Find full textNeapolitan, Richard E. Foundations of algorithms using C++ pseudocode. 2nd ed. Sudbury, Mass: Jones and Bartlett Publishers, 1998.
Find full textDurham), ACiD 2007 (2007 University of. Algorithms and complexity in Durham 2007: Proceedings of the third ACiD workshop. London: King's College Publication, 2007.
Find full textScandinavian Workshop on Algorithm Theory (9th 2004 Humlebæk, Denmark). Algorithm theory, SWAT 2004: 9th Scandinavian Workshop on Algorithm Theory, Humlebæk, Denmark, July 8-10, 2004 : proceedings. Berlin: Springer, 2004.
Find full text1953-, Gilbert J. R., and Karlsson R. 1950-, eds. SWAT 90: 2nd Scandinavian Workshop on Algorithm Theory, Berger, Sweden [i.e. Norway], July 11-14, 1990 : proceedings. Berlin: Springer-Verlag, 1990.
Find full textDurham), ACiD 2007 (2007 University of. Algorithms and complexity in Durham 2007: Proceedings of the third ACiD workshop. London: King's College Publication, 2007.
Find full textScandinavian Workshop on Algorithm Theory (1st 1988 Halmstad, Sweden). SWAT 88: 1st Scandinavian Workshop on Algorithm Theory, Halmstad, Sweden, July 5-8, 1988 : proceedings. Berlin: Springer-Verlag, 1988.
Find full text1952-, Bonuccelli M., Crescenzi Pierluigi, and Petreschi Rossella 1950-, eds. Algorithms and complexity: Second Italian conference, CIAC '94, Rome, Italy, February 23-25, 1994 : proceedings. Berlin: Springer-Verlag, 1994.
Find full textKomplexitätstheorie und Kryptologie: Eine Einführung in Kryptokomplexität. Berlin: Springer, 2008.
Find full textGoedecker, S. Low complexity algorithms for density functional electronic structure calculations. Ithaca, N.Y: Cornell Theory Center, Cornell University, 1993.
Find full text1950-, Karlsson R., and Lingas Andrzej, eds. Algorithm theory-- SWAT '96: 5th Scandinavian Workshop on Algorithm Theory, Reykjavík, Iceland, July 3-5, 1996 : proceedings. Berlin: Springer, 1996.
Find full textNeumann, Frank. Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity. Berlin, Heidelberg: Springer-Verlag Berlin Heidelberg, 2010.
Find full textAnderson, R. J. Parallel approximation algorithms for bin packing. Stanford, Calif: Dept. of Computer Science, Stanford University, 1988.
Find full textHemaspaandra, Lane A. Theory of Semi-Feasible Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003.
Find full textLawler, Eugene L. Selected publications of Eugene L. Lawler. Amsterdam, The Netherlands: CWI, 1999.
Find full textHotz, Günter. Algorithmen, Sprachen und Komplexität: Festvortrag gehalten am 15. Oktober 1990, anlässlich der Eröffnung des Wintersemesters 1990/91. Saarbrücken: Universität des Saarlandes, 1990.
Find full textM, Megson G., ed. Parallel algorithms for knapsack type problems. Singapore: World Scientific, 1999.
Find full textLakshmikantham, V. Computational error and complexity in science and engineering. Boston: Elsevier, 2005.
Find full text1952-, Harer J. (John), ed. Computational topology: An introduction. Providence, R.I: American Mathematical Society, 2010.
Find full textAlexander, Ostermann, ed. Analysis for computer scientists: Foundations, methods, and algorithms. London: Springer-Verlag, 2011.
Find full textJ, Atallah Mikhail, ed. Algorithms and theory of computation handbook. Boca Raton: CRC Press, 1999.
Find full textAntoine, Lobstein, and Cohen Gerard, eds. Algorithmic complexityand communication problems. London: UCL Press, 1996.
Find full textBorodin, Allan. Online computation and competitive analysis. Cambridge, [Eng.]: Cambridge University Press, 1998.
Find full textWang, Tse-kʻo. Algebraic systems of equations and computational complexity theory. Beijing: Science Press, 1994.
Find full textDieter, Kratsch, and SpringerLink (Online service), eds. Exact Exponential Algorithms. Berlin, Heidelberg: Springer-Verlag Berlin Heidelberg, 2010.
Find full textHertog, D. den. Interior point approach to linear, quadratic, and convex programming: Algorithms and complexity. Dordrecht: Kluwer Academic Publishers, 1994.
Find full textFlum, J., and M. Grohe. Parameterized Complexity Theory. Springer, 2006.
Find full textParameterized Complexity Theory. Springer, 2010.
Find full text(Editor), H. Broersma, S. Dantchev (Editor), and M. Johnson (Editor), eds. Algorithms and Complexity: Proceedings of the Third ACiD Workshop (Algorithms). College Publications, 2007.
Find full textPapadimitriou, Christos H., and Kenneth Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Dover Publications, Incorporated, 2013.
Find full textPapadimitriou, Christos H., and Kenneth Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Dover Publications, Incorporated, 2013.
Find full textAdvances in Algorithms, Languages, and Complexity. Springer, 2011.
Find full textDingzhu, Du, Ko Ker-I, and Book Ronald V, eds. Advances in algorithms, languages, and complexity. Dordrecht: Kluwer Academic, 1997.
Find full textFoundations of Algorithms. Jones & Bartlett Learning, 2014.
Find full textPal, Rajat K. Multi-layer Channel Routing: Complexity And Algorithms. Alpha Science International, Ltd, 2000.
Find full textTheory of Semi-Feasible Algorithms. Springer, 2002.
Find full textBlanton, Marina. Algorithms and Theory of Computation Handbook. 2nd ed. Chapman & Hall/CRC, 2009.
Find full textWidmayer, Peter, and Vangelis Th Paschos. Algorithms and Complexity: 9th International Conference, CIAC 2015, Paris, France, May 20-22, 2015. Proceedings. Springer International Publishing AG, 2015.
Find full textParameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series). Springer, 2006.
Find full text