scientific article; zbMATH DE number 7306863
From MaRDI portal
Publication:5148942
Yan Ru Pei, Massimiliano Di Ventra, Haik Manukian
Publication date: 5 February 2021
Full work available at URL: https://arxiv.org/abs/1905.05334
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Training restricted Boltzmann machines: an introduction
- The complexity of optimization problems
- Percolation on dense graph sequences
- Generalized darting Monte Carlo
- Many hard examples in exact phase transitions
- SAT distributions with planted assignments and phase transitions between decision and optimization problems
- Mode Jumping Proposals in MCMC
- The Relation Between Complete and Incomplete Search
- Training Products of Experts by Minimizing Contrastive Divergence
- Statistical mechanics, three-dimensionality and NP-completeness
- Open-WBO: A Modular MaxSAT Solver,
- Solving random satisfiable 3CNF formulas in expected polynomial time
- Information, Physics, and Computation
- Paley graphs satisfy all first-order adjacency axioms
- Vertex-switching, isomorphism, and pseudosimilarity
- On Algorithms for Enumerating All Circuits of a Graph
- Probability
- On the Complexity of Random Satisfiability Problems with Planted Solutions
- Polynomial-time solution of prime factorization and NP-complete problems with digital memcomputing machines
- Enumeration of the Elementary Circuits of a Directed Graph
- Finding All the Elementary Circuits of a Directed Graph
- Survey propagation: An algorithm for satisfiability
- Determining computational complexity from characteristic ‘phase transitions’
- Contribution to the Discussion of the Paper ‘Geodesic Monte Carlo on Embedded Manifolds’
- An algorithm for finding a fundamental set of cycles of a graph
- An efficient search algorithm to find the elementary circuits of a graph
- Average-Case Analysis for the MAX-2SAT Problem
- On Information and Sufficiency
- Statistical Theory of Equations of State and Phase Transitions. II. Lattice Gas and Ising Model
- Quasi-random graphs
- Stochastic gradient boosting.
This page was built for publication:
