scientific article; zbMATH DE number 3574966

Cited in

(51)

A note on coloring sparse random graphs
The largest tree in a random graph
How many random edges make a graph Hamiltonian?
A successful algorithm for the undirected Hamiltonian path problem
Convergence of optimal stochastic bin packing
Average case optimality
Randomized algorithms in combinatorial optimization: A survey
Average polynomial time complexity of some NP-complete problems
Reduction techniques providing initial groupings for Euclidean traveling salesman patching algorithms
Optimal search algorithm for extrema of a discrete periodic bimodal function
A probabilistic analysis of the switching algorithm for the Euclidean TSP
Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
An appraisal of computational complexity for operations researchers
Expected parallel time and sequential space complexity of graph and digraph problems
Randomised algorithms
Searching for an optimal path in a tree with random costs
Random decomposition of 0-1 linear integer programming problems and automatic choice of algorithms
Finding a large submatrix of a Gaussian random matrix
Optimal low-degree hardness of maximum independent set
On the average-case complexity of parameterized clique
On certain Hamiltonian inner triangulations
Secret sharing based on a hard-on-average problem
Problems of discrete optimization: challenges and main approaches to solve them
Limit distribution for the existence of Hamiltonian cycles in a random graph. (Reprint)
A-priori upper bounds for the set covering problem
Coloring random graphs
Performance of sequential local algorithms for the random NAE-K-SAT problem
Recent developments in information-based complexity
scientific article; zbMATH DE number 3770947 (Why is no real title available?)
Worst-Case Analysis of Network Design Problem Heuristics
A nearly tight sum-of-squares lower bound for the planted clique problem
An Average Case NP-complete Graph Colouring Problem
The Complexity of Public-Key Cryptography
The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs
Superlogarithmic cliques in dense inhomogeneous random graphs
The capacitated facility location problem with random input data
Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning
A generalization of maximal independent sets
Large deviations of the greedy independent set algorithm on sparse random graphs
Continuous approximation formulas for location problems
Graph and hypergraph colouring via nibble methods: a survey
Hardness of Random Optimization Problems for Boolean Circuits, Low-Degree Polynomials, and Langevin Dynamics
Average case analysis of greedy algorithms for optimisation problems on set systems
The low-degree hardness of finding large independent sets in sparse random hypergraphs
The average-case complexity of counting cliques in Erdős-Rényi hypergraphs
Finding planted cliques using gradient descent
Asymptotic optimality of degree-greedy discovering of independent sets in configuration model graphs
The strongish planted clique hypothesis and its consequences
Finding planted cycles in a random graph
Finding cliques and dense subgraphs using edge queries
A data structure useful for finding Hamiltonian cycles

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4144785)