Mathematics and computer science: coping with finiteness
From MaRDI portal
Publication:3096006
Recommendations
Cited in
(33)- Functorial Fast-Growing Hierarchies
- Modular arithmetic of iterated powers
- On color-critical (\(P_5\),\(\operatorname{co-}P_5\))-free graphs
- scientific article; zbMATH DE number 7556184 (Why is no real title available?)
- Critical scaling of lattice polymers confined to a box without endpoint restriction
- Homology of groups and third busy beaver function
- A fast-growing sequence inspired by \(\mathrm{TREE}(k)\)
- Pattern occurrence statistics and applications to the Ramsey theory of unavoidable patterns
- scientific article; zbMATH DE number 7561616 (Why is no real title available?)
- On the convergence of infinite towers of powers and logarithms for general initial data: applications to Lambert W function sequences
- Backtracking with multi-level dynamic search rearrangement
- Enhancement of coping through blurring
- Knuth's iterated powers
- The sample size required in importance sampling
- A sequential algorithm for generating random graphs
- Sequential importance sampling for estimating the number of perfect matchings in bipartite graphs: an ongoing conversation with Laci
- Spectra and satisfiability for logics with successor and a unary function
- Sequential importance sampling for multiresolution Kingman-Tajima coalescent counting
- Computers as a novel mathematical reality. I: A personal account
- Counting Walks and Graph Homomorphisms via Markov Chains and Importance Sampling
- On the importance sampling of self-avoiding walks
- Reduced word enumeration, complexity, and randomization
- Minimum energy requirements of information transfer and computing
- A new approach to the \(Z\)-transform through infinite computation
- On interior branch points of minimal surfaces
- Robust importance sampling with adaptive winsorization
- On interior branch points of minimal surfaces
- Exact solution of weighted partially directed walks crossing a square
- Four bugs on a rectangle
- Beyond Knuth's notation for unimaginable numbers within computational number theory
- scientific article; zbMATH DE number 7614167 (Why is no real title available?)
- Linear syzygies, hyperbolic Coxeter groups and regularity
- Binary trees as a computational framework
This page was built for publication: Mathematics and computer science: coping with finiteness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3096006)