Carregant...

Codi QR

How to think about algorithms

other_versions_link

Dades bibliogràfiques
Autor principal:	Edmonds, Jeff
Format:	Printed Book
Idioma:	English
Publicat:	New York Cambridge University Press 2008
Matèries:	Algorithms > Loops (Group theory) > Invariants > Recursion theory

Ítems similars

How to think about Algorithms
per: Jeff Edmonds
Publicat: (2008)

How to think about algorithms /
per: Edmonds, Jeff, 1963-
Publicat: (2008)

How to solve it by computer
per: Dromey,R G
Publicat: (1999)

Generalized recursion theory II : proceedings of the 1977 Oslo symposium /
per: Fenstad,J.E.ed
Publicat: (1974)

Recursion theory for metamathematics.
per: Smullyan, Raymond M.
Publicat: (1993)

Visual basic 6 from the ground up
per: Cornell, Gary
Publicat: (2000)

How to think about algorithms/
per: Edmonds, Jeff
Publicat: (2008)

How to Think about Algorithms
per: Jeff Edmonds
Publicat: (2008)

How to think about algorithms
per: Edmonds, Jeff
Publicat: (2008)

Introduction to the analysis of algorithms
per: Soltys, Michael
Publicat: (2010)

Diagonalization and self-reference.
per: Smullyan, Raymond M.
Publicat: (1996)

Foundation of algorithms
per: Neapolitan, Richard
Publicat: (2011)

Harmonic maps, loop groups, and integrable systems /
per: Guest, Martin A.
Publicat: (1997)

Recursive functions.-3rd ed.
per: Peter, Rozsa
Publicat: (1967)

An introduction to invariants and moduli /
per: Mukai, Shigeru
Publicat: (2003)

Sufficient Statistics
per: Huzurbazar Vasant S [Kshirsagar Anant M (Edi)]
Publicat: (1976)

Computability Theory;Vol.62
per: Weber,Rebecca

Algorithmic graph theory /
per: Gibbons, Alan
Publicat: (1985)

Recursion sequences
per: Markushevich, A.I.ed
Publicat: (1975)

Recursion sequences
per: Markushevich
Publicat: (1975)

Advanced programming and problem solving with Pascal
per: Scheider,G Michael
Publicat: (1987)

Planar Graphs: Theory and algorithms
per: Nishizeki, T
Publicat: (2008)

Permutation Group Algorithms
per: Seress, Ákos
Publicat: (2003)

Algorithmic algebraic number theory.
per: Pohst, M.
Publicat: (1989)

Sehaum`s out line of theory and problems of programming with basic
per: Gottfried,Byron S
Publicat: (1986)

Logic, sets and recursion
per: Causey, Robert L; Author
Publicat: (2010)

Algorithmic number theory V.1
per: Bach, Eric
Publicat: (1996)

Algorithmic probability : a collection of problems /
per: Neuts, Marcel F.
Publicat: (1995)

Information theory,inference, and learning algorithms /
per: Mackay, David J C
Publicat: (2003)

Algorithms on trees and graphs
per: Valiente, Gabriel; Author
Publicat: (2002)

Classical invariant theory.
per: Olver, Peter J.
Publicat: (1999)

Logic, sets and recursion
per: Causey, Robert L.
Publicat: (2010)

Loop spaces, characteristic classes and geometric quantization
per: Brylinski, Jean-Luc
Publicat: (1993)

Topological Dynamics
per: Gottschalk,Walter.Helbig and Hedlund,Gustav.Arnold
Publicat: (1955)

Recursively enumerable sets and degrees.
per: Soare, Robert J.
Publicat: (1987)

Classical Invariant Theory
per: Olver, Peter J.
Publicat: (1999)

Invariance and minimax statistical tests
per: Giri, N.
Publicat: (1975)

Elements of coordinate geometry
per: Loney, S L
Publicat: (1999)

Relative invariants of rings: the commutative theory
per: Oystaeyen, F Van
Publicat: (1983)

Polynomial invariants of finite groups /
per: Smith, L.
Publicat: (1995)