Pages that link to "Item:Q1050710"
From MaRDI portal
The following pages link to Minimization algorithms and random walk on the d-cube (Q1050710):
Displaying 26 items.
- The unbiased black-box complexity of partition is polynomial (Q460634) (← links)
- Ranking-based black-box complexity (Q528852) (← links)
- On the quantum query complexity of local search in two and three dimensions (Q835649) (← links)
- Quantum separation of local search and fixed point computation (Q848947) (← links)
- Random walks on highly symmetric graphs (Q923511) (← links)
- Cutoff phenomena for random walks on random regular graphs (Q984454) (← links)
- Enhanced algorithms for local search (Q1045925) (← links)
- Bounds on the cover time (Q1823547) (← links)
- Fourier transform over semi-simple algebras and harmonic analysis for probabilistic algorithms (Q1893975) (← links)
- Non-backtracking random walk (Q1942293) (← links)
- Giant vacant component left by a random walk in a random \(d\)-regular graph (Q1944664) (← links)
- Mixing time for the Ising model: a uniform lower bound for all graphs (Q1944667) (← links)
- The number of absorbed individuals in branching Brownian motion with a barrier (Q1951505) (← links)
- The local structure of globalization (Q1953114) (← links)
- Phase transition for the vacant set left by random walk on the giant component of a random graph (Q2346194) (← links)
- Bayesian inference for dynamic social network data (Q2455415) (← links)
- Random edge can be exponential on abstract cubes (Q2496719) (← links)
- Towards a Complexity Theory of Randomized Search Heuristics: Ranking-Based Black-Box Complexity (Q3007613) (← links)
- Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs (Q3541808) (← links)
- Self-intersections of random walks on discrete groups (Q3681675) (← links)
- On the time taken by random walks on finite groups to visit every state (Q3949710) (← links)
- ARRIVAL: Next Stop in CLS (Q5002737) (← links)
- Unique End of Potential Line (Q5091211) (← links)
- Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds (Q5138782) (← links)
- A non-local random walk on the hypercube (Q5233209) (← links)
- Quantum and classical query complexities of local search are polynomially related (Q5896965) (← links)
