Computational Complexity of Counting and Sampling
3108 Kč
Odesíláme do 1 až 2 týdnů
Sleva až 70% u třetiny knih
The purpose of the book is to give a comprehensive and detailed introduction to the computational complexity of counting and sampling. The book will consist of three main topics: I. Counting problems that are solvable in polynomial running time, II. Approximation algorithms for counting and sampling, III. Holographic algorithms--
| Autor: | Miklos, Istvan (Renyi Institute, Budapest, Hungary) |
| Nakladatel: | Taylor & Francis Ltd |
| ISBN: | 9781138035577 |
| Rok vydání: | 2019 |
| Jazyk : | Angličtina |
| Vazba: | Paperback / softback |
| Počet stran: | 390 |
Mohlo by se vám také líbit..
-
Philip II
Woodward, Geoffrey; Fellows, Nicholas
-
Sir Robert Peel
Evans Eric
-
Witchcraft in Tudor and Stuart England
Alan Macfarlane
-
Warfare and Society in the Barbarian...
Halsall Guy
-
The Protestant Reformation in Europe
Johnston, Andrew J.
-
Mediation in Family Disputes
Roberts, Marian
-
Medicine in Modern Britain 1780-1950
Brunton, Deborah (The Open University, UK)
-
On Belief
Slavoj Žižek
-
Human Rights and the Environment
Atapattu, Sumudu (University of Wisconsin, USA)
-
The Soviet Union under Brezhnev
Tompson, William J.
-
The Rise of the Labour Party 1880-1945
Adelman, Paul
-
The Government of the Roman Empire
Levick, Barbara (Emeritus Fellow, St Hilda's College, Oxford)
-
The Great War
Marc Ferro
-
Walking London's Medical Histor...
Gurol-Urganci, Ipek; Campbell, Fiona; Black, Nick; Jones, Lorelei
-
Mussolini and Italian Fascism
Finaldi, Giuseppe
-
Student Handbook of Criminal Justice...
Pichtel, John (Ball State University, Muncie, Indiana, USA)