Cargando…

Counting, sampling and integrating algorithm and complexity

Detalles Bibliográficos
Autor principal:	Jerrum, Mark
Lenguaje:	eng
Publicado:	Springer 2003
Materias:	Mathematical Physics and Mathematics
Acceso en línea:	https://dx.doi.org/10.1007/978-3-0348-8005-3 http://cds.cern.ch/record/1615252

Ejemplares similares

Computational complexity of counting and sampling
por: Miklos, Istvan
Publicado: (2019)

Randomized algorithms: approximation, generation and counting
por: van Rijsbergen, CJ, et al.
Publicado: (2001)

Complexity: knots, colourings and countings
por: Welsh, Dominic
Publicado: (1993)

Sampling algorithms
por: Tillé, Yves
Publicado: (2006)

Algorithms and complexity
por: Wilf, Herbert S
Publicado: (2002)

Algorithms and complexity
por: Wilf, Herbert S
Publicado: (1994)

Sampling algorithm for estimating Bayes factor
por: Borgos, H G, et al.
Publicado: (2000)

Algorithmic Randomness and Complexity
por: Downey, Rodney G, et al.
Publicado: (2010)

Advances in algorithms, languages, and complexity
por: Du, Ding-Zhu, et al.
Publicado: (1997)

Complex fluids: modeling and algorithms
por: Saramito, Pierre
Publicado: (2016)

Combinatorial optimization: algorithms and complexity
por: Papadimitriou, Christos H, et al.
Publicado: (1998)

Linear and Integer Programming vs Linear Integration and Counting: A Duality Viewpoint
por: Lasserre, Jean-Bernard
Publicado: (2009)

Approximation and optimization: algorithms, complexity and applications
por: Demetriou, Ioannis, et al.
Publicado: (2019)

An MCMC algorithm for sampling from the posterior conditioned to production history
por: Tjelmeland, H
Publicado: (2000)

The pleasures of counting
por: Körner, T W
Publicado: (1996)

Integral closure: Rees algebras, multiplicities, algorithms
por: Vasconcelos, Wolmer
Publicado: (2005)

Combinatorial complexes: a mathematical theory of algorithms
por: Sellers, Peter H
Publicado: (1979)

Symposium on Complexity of Sequential and Parallel Numerical Algorithms
por: Traub, Joe Fred
Publicado: (1973)

Lectures on complex integration
por: Tsitsishvili, Elena, et al.
Publicado: (2014)

Diophantine equations and power integral bases: theory and algorithms
por: Gaal, Istvan
Publicado: (2019)

Efficient algorithms for volterra integral equations of the second kind
por: El-Tom, M E A
Publicado: (1974)

Counting with symmetric functions
por: Mendes, Anthony, et al.
Publicado: (2015)

Algorithmic aspects of genetic sequences and relative Kolmogorov complexity
por: Grigorieva, A, et al.
Publicado: (2002)

Algorithms, complexity and discreteness criteria in PSL(2,C)
por: Gilman, J
Publicado: (1996)

Symposium on New Directions and Recent Results in Algorithms and Complexity
por: Traub, Joe Fred
Publicado: (1976)

Modelling frequency and count data
por: Lindsey, J K
Publicado: (1995)

Lattice path counting and applications
por: Mohanty, Gopal, et al.
Publicado: (1980)

How to count: an introduction to combinatorics
por: Allenby, RBJT, et al.
Publicado: (2010)

Discrete calculus: methods for counting
por: Mariconda, Carlo, et al.
Publicado: (2016)

Counting the art of enumerative combinatorics
por: Martin, George E
Publicado: (2001)

Regression Analysis of Count Data
por: Cameron, A Colin, et al.
Publicado: (1998)

Statistical analysis of counting processes
por: Jacobsen, Martin
Publicado: (1982)

Children's counting and concepts of number
por: Brainerd, Charles J, et al.
Publicado: (1988)

Handbook of integral transforms of higher transcendental functions: theory and algorithmic tables
por: Marichev, O I
Publicado: (1985)

Geometric Numerical Integration: Structure-Preserving Algorithms for Ordinary Differential Equations
por: Hairer, Ernst, et al.
Publicado: (2006)

Geometric numerical integration: structure-preserving algorithms for ordinary differential equations
por: Hairer, Ernst, et al.
Publicado: (2002)

The steiner tree problem: a tour through graphs, algorithms, and complexity
por: Prömel, Hans Jürgen, et al.
Publicado: (2002)

Interior point approach to linear, quadratic and convex programming: algorithms and complexity
por: Hertog, D
Publicado: (1994)

2015 and 2016 ACMES (Algorithms and Complexity in Mathematics, Epistemology, and Science) Conferences
por: Fillion, Nicolas, et al.
Publicado: (2019)

Tables of the exponential integral for complex arguments
por: National Bureau of Standards. Washington, DC
Publicado: (1958)

Cannot write session to /tmp/vufind_sessions/sess_r6lt6un2skvl01utdjdp9047fh