Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
From MaRDI portal
Publication:5886342
Recommendations
Cites work
- scientific article; zbMATH DE number 1670775 (Why is no real title available?)
- scientific article; zbMATH DE number 986989 (Why is no real title available?)
- scientific article; zbMATH DE number 3900794 (Why is no real title available?)
- scientific article; zbMATH DE number 3748431 (Why is no real title available?)
- scientific article; zbMATH DE number 3564899 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1111371 (Why is no real title available?)
- scientific article; zbMATH DE number 1552330 (Why is no real title available?)
- scientific article; zbMATH DE number 5050599 (Why is no real title available?)
- scientific article; zbMATH DE number 3400430 (Why is no real title available?)
- A calculus for the random generation of labelled combinatorial structures
- A deterministic algorithm to compute approximate roots of polynomial systems in polynomial average time
- A guide to Monte Carlo simulations in statistical physics.
- A linear algorithm for the random sampling from regular languages
- Algorithms for combinatorial structures: well-founded systems and Newton iterations
- An algorithm computing combinatorial specifications of permutation classes
- An algorithm for drawing general undirected graphs
- Analytic combinatorics
- Analytic samplers and the combinatorial rejection method
- Analyzing Boltzmann Samplers for Bose–Einstein Condensates with Dirichlet Generating Functions
- Asymptotic counting of BPS operators in superconformal field theories
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- Boltzmann Samplers, Pólya Theory, and Cycle Pointing
- Boltzmann samplers for first-order differential specifications
- Boltzmann sampling of unlabelled structures
- Central and local limit theorems applied to asymptotic enumeration. II: Multivariate generating functions
- Combinatorics of \(\lambda\)-terms: a natural approach
- Computing multiple roots of inexact polynomials
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Counting and sampling gene family evolutionary histories in the duplication-loss and duplication-loss-transfer models
- Disciplined convex programming
- Exact sampling with coupled Markov chains and applications to statistical mechanics
- Exact-size sampling for Motzkin trees in linear time via Boltzmann samplers and holonomic specification
- Foundational property-based testing
- Increasing diamonds
- Interior-point methods
- Mathematical problems for the next century
- Multi-dimensional Boltzmann sampling of languages
- Network science. With Márton Pósfai
- On the diversity of pattern distributions in rational language.
- On the number of lambda terms with prescribed size of their de Bruijn representation
- Pointed versus singular Boltzmann samplers: a comparative analysis
- Polynomial tuning of multiparametric combinatorial samplers
- Random Sampling of Plane Partitions
- Random generation of combinatorial structures from a uniform distribution
- Random-bit optimal uniform sampling for rooted planar trees with given sequence of degrees and applications
- Simple permutations and pattern restricted permutations
- Statistical mechanics of combinatorial partitions, and their limit shapes
- The complexity of counting problems
- The number of trees
- Uniform random generation of decomposable structures using floating-point arithmetic
- Validated computation of the local truncation error of Runge-Kutta methods with automatic differentiation
Cited in
(2)
Describes a project that uses
Uses Software
This page was built for publication: Tuning as convex optimisation: a polynomial tuner for multi-parametric combinatorial samplers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5886342)
