- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783764369460
3764369469
- Dimensions
-
24 cm
- Extent
-
XI, 112 S.
- Language
-
Englisch
- Notes
-
graph. Darst.
Literaturverz. S. 105 - 110
- Keyword
-
Graph
Markov-Prozess
Berechnungskomplexität
Markov-Ketten-Monte-Carlo-Verfahren
- Event
-
Veröffentlichung
- (where)
-
Basel, Boston, Berlin
- (who)
-
Birkhäuser
- (when)
-
2003
- Creator
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.06.2025, 2:10 PM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Jerrum, Mark
- Birkhäuser
Time of origin
- 2003
Other Objects (12)
Quantum algorithms for weighted constrained sampling and weighted model counting
Sampling Algorithms
Pseudorandomness for Approximate Counting and Sampling
Tutorial - Counting algorithms over matroids
Randomized algorithms : approximation, generation and counting
Blind multiband sampling algorithms
Conjunctive queries, arithmetic circuits and counting complexity
Conjunctive queries, arithmetic circuits and counting complexity
Descriptive complexity of circuit-based counting classes
Semiring extensions for model counting and model sampling
Graph sampling for subgraph counting on directed graphs
Sampling algorithms for evolving datasets
Quantum algorithms for weighted constrained sampling and weighted model counting
Sampling Algorithms
Pseudorandomness for Approximate Counting and Sampling
Tutorial - Counting algorithms over matroids
Randomized algorithms : approximation, generation and counting
Blind multiband sampling algorithms
Conjunctive queries, arithmetic circuits and counting complexity
Conjunctive queries, arithmetic circuits and counting complexity
Descriptive complexity of circuit-based counting classes
Semiring extensions for model counting and model sampling
Graph sampling for subgraph counting on directed graphs
Sampling algorithms for evolving datasets
Quantum algorithms for weighted constrained sampling and weighted model counting
Sampling Algorithms
Pseudorandomness for Approximate Counting and Sampling
Tutorial - Counting algorithms over matroids
Randomized algorithms : approximation, generation and counting
Blind multiband sampling algorithms
Conjunctive queries, arithmetic circuits and counting complexity
Conjunctive queries, arithmetic circuits and counting complexity
Descriptive complexity of circuit-based counting classes
Semiring extensions for model counting and model sampling
Graph sampling for subgraph counting on directed graphs