Books on the topic 'Low computational complexity algorithms'

To see the other types of publications on this topic, follow the link: Low computational complexity algorithms.

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

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.

1

Kronsjö, Lydia. Computational complexity of sequential and parallel algorithms. Chichester: Wiley, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Kronsjö, Lydia I. Computational complexity of sequential and parallel algorithms. Chichester: Wiley, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Computational complexity of sequential and parallel algorithms. Chichester: Wiley, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wilf, Herbert S. Algorithms and complexity. Englewood Cliffs, N.J: Prentice-Hall, 1986.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Algorithms and complexity. 2nd ed. Natick, Mass: A.K. Peters, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

1939-, Steiglitz Kenneth, ed. Combinatorial optimization: Algorithms and complexity. Mineola, N.Y: Dover Publications, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Neapolitan, Richard E. Foundations of algorithms. 4th ed. Sudbury, Mass: Jones and Bartlett Publishers, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kumarss, Naimipour, ed. Foundations of algorithms. 4th ed. Sudbury, Mass: Jones and Bartlett Publishers, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Algorithms: Their complexity and efficiency. 2nd ed. Chichester: Wiley, 1987.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Complexity theory: Exploring the limits of efficient algorithms. Berlin: Springer, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
11

Counting, sampling and integrating: Algorithms and complexity. Boston, MA: Birkhauser Verlag, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
12

Kumarss, Naimipour, ed. Foundations of algorithms using C++ pseudocode. 3rd ed. Sudbury, Mass: Jones and Bartlett, 2004.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
13

Neapolitan, Richard E. Foundations of algorithms using C++ pseudocode. 2nd ed. Sudbury, Mass: Jones and Bartlett Publishers, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
14

Durham), 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 text
APA, Harvard, Vancouver, ISO, and other styles
15

Scandinavian 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 text
APA, Harvard, Vancouver, ISO, and other styles
16

1953-, 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 text
APA, Harvard, Vancouver, ISO, and other styles
17

Durham), 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 text
APA, Harvard, Vancouver, ISO, and other styles
18

Scandinavian 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 text
APA, Harvard, Vancouver, ISO, and other styles
19

1952-, 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 text
APA, Harvard, Vancouver, ISO, and other styles
20

Komplexitätstheorie und Kryptologie: Eine Einführung in Kryptokomplexität. Berlin: Springer, 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
21

Goedecker, S. Low complexity algorithms for density functional electronic structure calculations. Ithaca, N.Y: Cornell Theory Center, Cornell University, 1993.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
22

1950-, 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 text
APA, Harvard, Vancouver, ISO, and other styles
23

Neumann, Frank. Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity. Berlin, Heidelberg: Springer-Verlag Berlin Heidelberg, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
24

Anderson, R. J. Parallel approximation algorithms for bin packing. Stanford, Calif: Dept. of Computer Science, Stanford University, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
25

Hemaspaandra, Lane A. Theory of Semi-Feasible Algorithms. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
26

Lawler, Eugene L. Selected publications of Eugene L. Lawler. Amsterdam, The Netherlands: CWI, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
27

Hotz, 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 text
APA, Harvard, Vancouver, ISO, and other styles
28

M, Megson G., ed. Parallel algorithms for knapsack type problems. Singapore: World Scientific, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
29

Lakshmikantham, V. Computational error and complexity in science and engineering. Boston: Elsevier, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
30

1952-, Harer J. (John), ed. Computational topology: An introduction. Providence, R.I: American Mathematical Society, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
31

Alexander, Ostermann, ed. Analysis for computer scientists: Foundations, methods, and algorithms. London: Springer-Verlag, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
32

J, Atallah Mikhail, ed. Algorithms and theory of computation handbook. Boca Raton: CRC Press, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
33

Antoine, Lobstein, and Cohen Gerard, eds. Algorithmic complexityand communication problems. London: UCL Press, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
34

Borodin, Allan. Online computation and competitive analysis. Cambridge, [Eng.]: Cambridge University Press, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
35

Wang, Tse-kʻo. Algebraic systems of equations and computational complexity theory. Beijing: Science Press, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
36

Dieter, Kratsch, and SpringerLink (Online service), eds. Exact Exponential Algorithms. Berlin, Heidelberg: Springer-Verlag Berlin Heidelberg, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
37

Hertog, D. den. Interior point approach to linear, quadratic, and convex programming: Algorithms and complexity. Dordrecht: Kluwer Academic Publishers, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
38

Flum, J., and M. Grohe. Parameterized Complexity Theory. Springer, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
39

Parameterized Complexity Theory. Springer, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
40

(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 text
APA, Harvard, Vancouver, ISO, and other styles
41

Papadimitriou, Christos H., and Kenneth Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Dover Publications, Incorporated, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
42

Papadimitriou, Christos H., and Kenneth Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Dover Publications, Incorporated, 2013.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
43

Advances in Algorithms, Languages, and Complexity. Springer, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
44

Dingzhu, Du, Ko Ker-I, and Book Ronald V, eds. Advances in algorithms, languages, and complexity. Dordrecht: Kluwer Academic, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
45

Foundations of Algorithms. Jones & Bartlett Learning, 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
46

Pal, Rajat K. Multi-layer Channel Routing: Complexity And Algorithms. Alpha Science International, Ltd, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
47

Theory of Semi-Feasible Algorithms. Springer, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
48

Blanton, Marina. Algorithms and Theory of Computation Handbook. 2nd ed. Chapman & Hall/CRC, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
49

Widmayer, 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 text
APA, Harvard, Vancouver, ISO, and other styles
50

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series). Springer, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography