On the public citation graph
Rigorous location of phase transitions in hard optimization problems
0 signed · 283 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1098-2418(199805)12:3<253::aid-rsa3>3.0.co;2-uopenalex-snapshot
Approximating the unsatisfiability threshold of random formulas
inferredcites →https://doi.org/10.1002/rsa.20015openalex-snapshot
Random MAX SAT, random MAX CUT, and their phase transitions
inferredcites →https://doi.org/10.1006/jagm.1996.0016openalex-snapshot
Analysis of Two Simple Heuristics on a Random Instance ofk-sat
inferredcites →https://doi.org/10.1007/3-540-45749-6_51openalex-snapshot
The Probabilistic Analysis of a Greedy Satisfiability Algorithm
inferredcites →https://doi.org/10.1038/22055openalex-snapshot
Determining computational complexity from characteristic ‘phase transitions’
inferredcites →https://doi.org/10.1088/0305-4470/19/9/033openalex-snapshot
Application of statistical mechanics to NP-complete problems in combinatorial optimisation
inferredcites →https://doi.org/10.1090/s0002-9904-1976-14122-5openalex-snapshot
Every planar map is four colorable
inferredcites →https://doi.org/10.1090/s0894-0347-04-00464-3openalex-snapshot
The threshold for random 𝑘-SAT is 2^{𝑘}log2-𝑂(𝑘)
inferredcites →https://doi.org/10.1090/s0894-0347-99-00305-7openalex-snapshot
Sharp thresholds of graph properties, and the $k$-sat problem
inferredcites →https://doi.org/10.1103/physreve.56.1357openalex-snapshot
Statistical mechanics of the random K -satisfiability model
inferredcites →https://doi.org/10.1103/physreve.66.056126openalex-snapshot
Random K -satisfiability problem: From an analytic solution to an efficient algorithm
inferredcites →https://doi.org/10.1103/physreve.70.046705openalex-snapshot
Threshold values, stability analysis, and high- q asymptotics for the coloring problem on random graphs
inferredcites →https://doi.org/10.1109/sfcs.2002.1182003openalex-snapshot
The asymptotic order of the random k-SAT threshold
inferredcites →https://doi.org/10.1109/sfcs.2003.1238210openalex-snapshot
On the maximum satisfiability of random formulas
inferredcites →https://doi.org/10.1126/science.1073287openalex-snapshot
Analytic and Algorithmic Solution of Random Satisfiability Problems
inferredcites →https://doi.org/10.1126/science.264.5163.1297openalex-snapshot
Critical Behavior in the Satisfiability of Random Boolean Expressions
inferredcites →https://doi.org/10.1145/1007352.1007442openalex-snapshot
The two possible values of the chromatic number of a random graph
inferredcites →https://doi.org/10.1145/780542.780577openalex-snapshot
The threshold for random k-SAT is 2 k (ln 2 - O(k))
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.48550/arxiv.cs/0211036openalex-snapshot
Typical random 3-SAT formulae and the satisfiability threshold
inferredcites →https://doi.org/10.48550/arxiv.math/0306047openalex-snapshot
Random MAX SAT, Random MAX CUT, and Their Phase Transitions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.3217/jucs-013-04-0572openalex-extracted
Random k-GD-Sat Model and its Phase Transition.
inferred← citeshttps://doi.org/10.1002/rsa.20323openalex-snapshot
On the solution‐space geometry of random constraint satisfaction problems
inferred← citeshttps://doi.org/10.1002/rsa.20501openalex-snapshot
On the concentration of the number of solutions of random satisfiability formulas
inferred← citeshttps://doi.org/10.1002/rsa.20738openalex-snapshot
On the max‐cut of sparse random graphs
inferred← citeshttps://doi.org/10.1002/rsa.20824openalex-snapshot
Hypergraph coloring up to condensation
inferred← citeshttps://doi.org/10.1002/rsa.70013openalex-snapshot
On the Replica Symmetric Solution in General Diluted Spin Glasses
inferred← citeshttps://doi.org/10.1007/11786986_31openalex-snapshot
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
inferred← citeshttps://doi.org/10.1007/978-0-387-49650-4_15openalex-snapshot
Phase Transitions in Genetic Programming Search
inferred← citeshttps://doi.org/10.1007/978-1-4419-1665-5_19openalex-snapshot
Stochastic Search in Metaheuristics
inferred← citeshttps://doi.org/10.1007/978-1-4614-6642-0_4openalex-snapshot
Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition
inferred← citeshttps://doi.org/10.1007/978-1-84628-887-6_7openalex-snapshot
Solving NP-Complete Problems with a Quantum Computer
inferred← citeshttps://doi.org/10.1007/978-3-030-22312-0_9openalex-snapshot
Removing Problems in Rule-Based Policies
inferred← citeshttps://doi.org/10.1007/978-3-319-05170-3_34openalex-snapshot
Characterization of the Optimization Process
inferred← citeshttps://doi.org/10.1007/978-3-319-59605-1_24openalex-snapshot
Phase Transition for Maximum Not-All-Equal Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-319-65558-1openalex-snapshot
Probabilistic Cellular Automata: Theory, Applications and Future Perspectives
inferred← citeshttps://doi.org/10.1007/978-3-319-65558-1_1openalex-snapshot
Overview: PCA Models and Issues
inferred← citeshttps://doi.org/10.1007/978-3-319-91086-4_16openalex-snapshot
Stochastic Search in Metaheuristics
inferred← citeshttps://doi.org/10.1007/978-3-540-73922-7_13openalex-snapshot
Phase Transition and the Computational Complexity of Generating r-Contiguous Detectors
inferred← citeshttps://doi.org/10.1007/978-3-540-76928-6_63openalex-snapshot
Time-Reversal in Conway’s Life as SAT
inferred← citeshttps://doi.org/10.1007/978-3-540-85958-1_42openalex-snapshot
Edge Matching Puzzles as Hard SAT/CSP Benchmarks
inferred← citeshttps://doi.org/10.1007/978-3-642-05258-3_33openalex-snapshot
Phase Transition in the Bandwidth Minimization Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-11169-3_7openalex-snapshot
A Knowledge Discovery Approach to Understanding Relationships between Scheduling Problem Structure and Heuristic Performance
inferred← citeshttps://doi.org/10.1007/978-3-642-14186-7_19openalex-snapshot
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-21581-0_31openalex-snapshot
Phase Transitions in Knowledge Compilation: An Experimental Study
inferred← citeshttps://doi.org/10.1007/978-3-642-30671-6_16openalex-snapshot
Predicting Metaheuristic Performance on Graph Coloring Problems Using Data Mining
inferred← citeshttps://doi.org/10.1007/978-3-642-32378-2_6openalex-snapshot
The Algorithm Selection Problem on the Continuous Optimization Domain
inferred← citeshttps://doi.org/10.1007/978-3-642-40328-6_24openalex-snapshot
Conditional Random Fields, Planted Constraint Satisfaction and Entropy Concentration
inferred← citeshttps://doi.org/10.1007/978-3-642-44973-4_42openalex-snapshot
Algorithm Selection for the Graph Coloring Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-54140-7_9openalex-snapshot
Addressing Phase Transitions in Wireless Networking Optimization
inferred← citeshttps://doi.org/10.1007/s00220-018-3096-xopenalex-snapshot
Charting the Replica Symmetric Phase
inferred← citeshttps://doi.org/10.1007/s00220-019-03544-yopenalex-snapshot
Spin Systems on Bethe Lattices
inferred← citeshttps://doi.org/10.1007/s00220-023-04644-6openalex-snapshot
Metastability of the Potts Ferromagnet on Random Regular Graphs
inferred← citeshttps://doi.org/10.1007/s00220-023-04868-6openalex-snapshot
One-Step Replica Symmetry Breaking of Random Regular NAE-SAT II
inferred← citeshttps://doi.org/10.1007/s00440-023-01248-yopenalex-snapshot
Tractability from overparametrization: the example of the negative perceptron
inferred← citeshttps://doi.org/10.1007/s00440-024-01337-6openalex-snapshot
Local geometry of NAE-SAT solutions in the condensation regime
inferred← citeshttps://doi.org/10.1007/s00493-019-3897-3openalex-snapshot
The Satisfiability Threshold For Random Linear Equations
inferred← citeshttps://doi.org/10.1007/s10462-011-9256-4openalex-snapshot
Toward understanding the optimization of complex systems
inferred← citeshttps://doi.org/10.1007/s10601-012-9128-9openalex-snapshot
On the hardness of solving edge matching puzzles as SAT or CSP problems
inferred← citeshttps://doi.org/10.1007/s10878-014-9789-yopenalex-snapshot
Bounding the scaling window of random constraint satisfaction problems
inferred← citeshttps://doi.org/10.1007/s10898-021-01003-4openalex-snapshot
Maximum feasible subsystems of distance geometry constraints
inferred← citeshttps://doi.org/10.1007/s10955-006-9247-zopenalex-snapshot
String Matching and 1d Lattice Gases
inferred← citeshttps://doi.org/10.1007/s11047-008-9097-5openalex-snapshot
Foundations of r-contiguous matching in negative selection for anomaly detection
inferred← citeshttps://doi.org/10.1007/s11128-010-0168-zopenalex-snapshot
A study of heuristic guesses for adiabatic quantum computation
inferred← citeshttps://doi.org/10.1007/s11432-014-5154-0openalex-snapshot
Experimental analyses on phase transitions in compiling satisfiability problems
inferred← citeshttps://doi.org/10.1007/s11432-016-0258-4openalex-snapshot
A randomized diversification strategy for solving satisfiability problem with long clauses
inferred← citeshttps://doi.org/10.1007/s11511-010-0046-7openalex-snapshot
The mean field traveling salesman and related problems
inferred← citeshttps://doi.org/10.1007/s11511-017-0145-9openalex-snapshot
Maximum independent sets on random regular graphs
inferred← citeshttps://doi.org/10.1016/b0-08-045044-x/00275-3openalex-snapshot
Multiobjective/Multicriteria Optimization and Decision Support in Drug Discovery
inferred← citeshttps://doi.org/10.1016/b0-12-512666-2/00133-4openalex-snapshot
Statistical Mechanics and Combinatorial Problems
inferred← citeshttps://doi.org/10.1016/b978-0-323-95703-8.00124-5openalex-snapshot
Statistical Mechanics and Combinatorial Problems
inferred← citeshttps://doi.org/10.1016/j.aim.2015.11.007openalex-snapshot
The asymptotic k-SAT threshold
inferred← citeshttps://doi.org/10.1016/j.aim.2018.05.029openalex-snapshot
Information-theoretic thresholds from the cavity method
inferred← citeshttps://doi.org/10.1016/j.artint.2010.11.004openalex-snapshot
On the phase transitions of random k-constraint satisfaction problems
inferred← citeshttps://doi.org/10.1016/j.cor.2011.07.006openalex-snapshot
Measuring instance difficulty for combinatorial optimization problems
inferred← citeshttps://doi.org/10.1016/j.cosrev.2008.02.001openalex-snapshot
The consequences of eliminating NP solutions
inferred← citeshttps://doi.org/10.1016/j.dam.2013.11.005openalex-snapshot
Exploring the role of graph spectra in graph coloring algorithm performance
inferred← citeshttps://doi.org/10.1016/j.ejc.2017.06.012openalex-snapshot
Limits of discrete distributions and Gibbs measures on random graphs
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.12.009openalex-snapshot
A new class of hard problem instances for the 0–1 knapsack problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2023.04.023openalex-snapshot
Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
inferred← citeshttps://doi.org/10.1016/j.eswa.2011.02.103openalex-snapshot
Self-organized combinatorial optimization
inferred← citeshttps://doi.org/10.1016/j.eswa.2019.112908openalex-snapshot
Automatic design of specialized algorithms for the binary knapsack problem
inferred← citeshttps://doi.org/10.1016/j.ins.2013.09.050openalex-snapshot
Assisting in search heuristics selection through multidimensional supervised classification: A case study on software testing
inferred← citeshttps://doi.org/10.1016/j.jmp.2021.102592openalex-snapshot
Generic properties of a computational task predict human effort and performance
inferred← citeshttps://doi.org/10.1016/j.tics.2017.09.005openalex-snapshot
Computational Complexity and Human Decision-Making
inferred← citeshttps://doi.org/10.1016/s0924-8099(07)80008-4openalex-snapshot
Course 1 Introduction to phase transitions in random optimization problems
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03002-7openalex-snapshot
Chapter 2 Satisfiability Solvers
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)x0300-6openalex-snapshot
Handbook of Knowledge Representation
inferred← citeshttps://doi.org/10.1017/9781108635349openalex-snapshot
The Probability Companion for Engineering and Computer Science
inferred← citeshttps://doi.org/10.1017/9781108635349.008openalex-snapshot
Mathematics of Random Variables
inferred← citeshttps://doi.org/10.1017/cbo9781139207065.002openalex-snapshot
Body and world as phenomenal contents of the brain's reality model
inferred← citeshttps://doi.org/10.1017/s0963548307008474openalex-snapshot
Thresholds and Expectation Thresholds
inferred← citeshttps://doi.org/10.1017/s0963548318000263openalex-snapshot
The Number of Satisfying Assignments of Random Regulark-SAT Formulas
inferred← citeshttps://doi.org/10.1017/s0963548319000440openalex-snapshot
The replica symmetric phase of random constraint satisfaction problems
inferred← citeshttps://doi.org/10.1017/s0963548326100406openalex-snapshot
The random italic k k $\textit{k}$ -SAT Gibbs uniqueness threshold revisited
inferred← citeshttps://doi.org/10.1017/s1471068414000611openalex-snapshot
Random logic programs: Linear model
inferred← citeshttps://doi.org/10.1021/jp0645115openalex-snapshot
Gaseous Arginine Conformers and Their Unique Intramolecular Interactions
inferred← citeshttps://doi.org/10.1038/nphys2105openalex-snapshot
Optimization hardness as transient chaos in an analog approach to constraint satisfaction
inferred← citeshttps://doi.org/10.1073/pnas.0610471104openalex-snapshot
Improved evolutionary optimization from genetically adaptive multimethod search
inferred← citeshttps://doi.org/10.1073/pnas.0703685104openalex-snapshot
Gibbs states and the set of solutions of random constraint satisfaction problems
inferred← citeshttps://doi.org/10.1088/1572-9494/ac4896openalex-snapshot
A residual-based message passing algorithm for constraint satisfaction problems
inferred← citeshttps://doi.org/10.1088/1742-5468/2007/10/p10012openalex-snapshot
Clustering of solutions in hard satisfiability problems
inferred← citeshttps://doi.org/10.1088/1742-5468/2008/12/p12004openalex-snapshot
Constraint satisfaction problems with isolated solutions are hard
inferred← citeshttps://doi.org/10.1088/1742-5468/2010/10/p10010openalex-snapshot
Ground-state configuration space heterogeneity of random finite-connectivity spin glasses and random constraint satisfaction problems
inferred← citeshttps://doi.org/10.1088/1742-5468/2011/02/p02019openalex-snapshot
A message-passing approach to random constraint satisfaction problems with growing domains
inferred← citeshttps://doi.org/10.1088/1742-5468/2011/12/p12007openalex-snapshot
Characterizing and improving generalized belief propagation algorithms on the 2D Edwards–Anderson model
inferred← citeshttps://doi.org/10.1088/1742-5468/2012/05/p05009openalex-snapshot
On the behaviour of randomK-SAT on trees
inferred← citeshttps://doi.org/10.1088/1742-5468/ab409dopenalex-snapshot
Constructing concrete hard instances of the maximum independent set problem
inferred← citeshttps://doi.org/10.1088/1742-6596/95/1/012012openalex-snapshot
Phase transitions and computational difficulty in random constraint satisfaction problems
inferred← citeshttps://doi.org/10.1088/1751-8113/40/5/001openalex-snapshot
Can rare SAT formulae be easily recognized? On the efficiency of message-passing algorithms for K -SAT at large clause-to-variable ratios
inferred← citeshttps://doi.org/10.1088/2632-072x/abdadcopenalex-snapshot
Computational phase transitions: benchmarking Ising machines and quantum optimisers
inferred← citeshttps://doi.org/10.1090/bull/1857openalex-snapshot
Searching for (sharp) thresholds in random structures: Where are we now?
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.001.0001openalex-snapshot
Information, Physics, and Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.002.0003openalex-snapshot
Copyright Page
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0001openalex-snapshot
Introduction to information theory
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0002openalex-snapshot
Statistical physics and probability theory
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0003openalex-snapshot
Introduction to combinatorial optimization
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0004openalex-snapshot
A probabilistic toolbox
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0005openalex-snapshot
The random energy model
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0006openalex-snapshot
The random code ensemble
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0007openalex-snapshot
Number partitioning
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0008openalex-snapshot
Introduction to replica theory
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0009openalex-snapshot
Factor graphs and graph ensembles
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0010openalex-snapshot
Satisfiability
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0011openalex-snapshot
Low-density parity-check codes
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0012openalex-snapshot
Spin glasses
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0013openalex-snapshot
Bridges: Inference and the Monte Carlo method
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0014openalex-snapshot
Belief propogation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0015openalex-snapshot
Decoding with belief propagation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0016openalex-snapshot
The assignment problem
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0017openalex-snapshot
Ising models on random graph
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0018openalex-snapshot
Linear equations with Boolean variables
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0019openalex-snapshot
The 1RSB cavity method
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0020openalex-snapshot
Random K-satisfiability
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0021openalex-snapshot
Glassy states in coding theory
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.003.0022openalex-snapshot
An ongoing story
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198570837.005.0001openalex-snapshot
Symbols and notation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780198743736.003.0007openalex-snapshot
Constraint satisfaction: random regulark-SAT
inferred← citeshttps://doi.org/10.1098/rstb.2018.0138openalex-snapshot
Uncertainty and computational complexity
inferred← citeshttps://doi.org/10.1101/2022.01.05.475102openalex-snapshot
The neural dynamics associated with computational complexity
inferred← citeshttps://doi.org/10.1103/physreve.102.012301openalex-snapshot
Maximally flexible solutions of a random K -satisfiability formula
inferred← citeshttps://doi.org/10.1103/physreve.74.037702openalex-snapshot
Behavior of heuristics on large and hard satisfiability problems
inferred← citeshttps://doi.org/10.1103/physreve.75.051108openalex-snapshot
Complexity of the predecessor problem in Kauffman networks
inferred← citeshttps://doi.org/10.1103/physreve.76.031131openalex-snapshot
Phase transitions in the coloring of random graphs
inferred← citeshttps://doi.org/10.1103/physreve.77.031118openalex-snapshot
Entropy landscape and non-Gibbs solutions in constraint satisfaction problems
inferred← citeshttps://doi.org/10.1103/physreve.80.066108openalex-snapshot
Communities of solutions in single solution clusters of a random K -satisfiability formula
inferred← citeshttps://doi.org/10.1103/physreve.82.061109openalex-snapshot
Finite-size scaling in random K -satisfiability problems
inferred← citeshttps://doi.org/10.1103/physreve.85.016106openalex-snapshot
Analytical and belief-propagation studies of random constraint satisfaction problems with growing domains
inferred← citeshttps://doi.org/10.1103/physreve.86.010105openalex-snapshot
Phase transition in the countdown problem
inferred← citeshttps://doi.org/10.1103/physreve.90.052813openalex-snapshot
Origin of the computational hardness for learning with binary synapses
inferred← citeshttps://doi.org/10.1103/physreve.93.052211openalex-snapshot
Order-to-chaos transition in the hardness of random Boolean satisfiability problems
inferred← citeshttps://doi.org/10.1103/physrevlett.95.200202openalex-snapshot
Landscape of Solutions in Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1103/revmodphys.80.1275openalex-snapshot
Critical phenomena in complex networks
inferred← citeshttps://doi.org/10.1109/access.2019.2947992openalex-snapshot
On the Feasibility of 5G Slice Resource Allocation With Spectral Efficiency: A Probabilistic Characterization
inferred← citeshttps://doi.org/10.1109/cdc.2009.5400085openalex-snapshot
Survey on computational complexity with phase transitions and extremal optimization
inferred← citeshttps://doi.org/10.1109/cec.2019.8790323openalex-snapshot
Fitness Landscape Analysis in Data-Driven Optimization: An Investigation of Clustering Problems
inferred← citeshttps://doi.org/10.1109/foci.2011.5949471openalex-snapshot
A study on the complexity of TSP instances under the 2-exchange neighbor system
inferred← citeshttps://doi.org/10.1109/focs.2007.4389492openalex-snapshot
Reconstruction for Models on Random Graphs
inferred← citeshttps://doi.org/10.1109/focs.2007.58openalex-snapshot
Reconstruction for Models on Random Graphs
inferred← citeshttps://doi.org/10.1109/focs.2008.11openalex-snapshot
Algorithmic Barriers from Phase Transitions
inferred← citeshttps://doi.org/10.1109/focs.2015.47openalex-snapshot
Community Detection in General Stochastic Block models: Fundamental Limits and Efficient Algorithms for Recovery
inferred← citeshttps://doi.org/10.1109/focs52979.2021.00039openalex-snapshot
One-step replica symmetry breaking of random regular NAE-SAT
inferred← citeshttps://doi.org/10.1109/ijcnn.2008.4634391openalex-snapshot
Towards insightful algorithm selection for optimisation using meta-learning concepts
inferred← citeshttps://doi.org/10.1109/innovations.2008.4781758openalex-snapshot
Multiple statistical validations for sensor networks optimization
inferred← citeshttps://doi.org/10.1109/ismvl.2009.55openalex-snapshot
Bounding the Phase Transition on Edge Matching Puzzles
inferred← citeshttps://doi.org/10.1109/sera.2009.36openalex-snapshot
MHC-inspired Antibody Clone Algorithm for Multimodal Function Optimization
inferred← citeshttps://doi.org/10.1109/tac.2010.2078170openalex-snapshot
Stochastic Optimization on Continuous Domains With Finite-Time Guarantees by Markov Chain Monte Carlo Methods
inferred← citeshttps://doi.org/10.1109/tap.2007.891569openalex-snapshot
Hybrid Algorithms for Electromagnetic Problems and the No-Free-Lunch Framework
inferred← citeshttps://doi.org/10.1109/tevc.2009.2033579openalex-snapshot
Learning the Large-Scale Structure of the MAX-SAT Landscape Using Populations
inferred← citeshttps://doi.org/10.1109/tevc.2011.2163638openalex-snapshot
Maximum Satisfiability: Anatomy of the Fitness Landscape for a Hard Combinatorial Optimization Problem
inferred← citeshttps://doi.org/10.1109/tit.2017.2673829openalex-snapshot
Reed–Muller Codes Achieve Capacity on Erasure Channels
inferred← citeshttps://doi.org/10.1109/tit.2020.3023377openalex-snapshot
Information-Theoretic and Algorithmic Thresholds for Group Testing
inferred← citeshttps://doi.org/10.1109/tnet.2012.2222923openalex-snapshot
Decentralized Constraint Satisfaction
inferred← citeshttps://doi.org/10.1109/tqe.2025.3558090openalex-snapshot
A Comprehensive Cross-Model Framework for Benchmarking the Performance of Quantum Hamiltonian Simulations
inferred← citeshttps://doi.org/10.1126/sciadv.1601246openalex-snapshot
Stabilizers as a design tool for new forms of the Lechner-Hauke-Zoller annealer
inferred← citeshttps://doi.org/10.1137/070680382openalex-snapshot
Random Formulas Have Frozen Variables
inferred← citeshttps://doi.org/10.1137/07070440xopenalex-snapshot
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
inferred← citeshttps://doi.org/10.1137/070708093openalex-snapshot
The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
inferred← citeshttps://doi.org/10.1137/090755862openalex-snapshot
Reconstruction and Clustering in Random Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.1137/1.9781611973082.74openalex-snapshot
On Belief Propagation Guided Decimation for Random k -SAT
inferred← citeshttps://doi.org/10.1137/1.9781611973099.62openalex-snapshot
The Set of Solutions of Random XORSAT Formulae
inferred← citeshttps://doi.org/10.1140/epjb/e2008-00324-5openalex-snapshot
Solution clustering in random satisfiability
inferred← citeshttps://doi.org/10.1140/epjb/e2010-00173-7openalex-snapshot
On the thresholds in linear and nonlinear Boolean equations
inferred← citeshttps://doi.org/10.1142/s0219876210002179openalex-snapshot
MHC-INSPIRED ANTIBODY CLONE ALGORITHM
inferred← citeshttps://doi.org/10.1145/1132516.1132537openalex-snapshot
On the solution-space geometry of random constraint satisfaction problems
inferred← citeshttps://doi.org/10.1145/1374618.1374667openalex-snapshot
Challenging benchmark for location discovery in ad hoc networks
inferred← citeshttps://doi.org/10.1145/1456650.1456656openalex-snapshot
Cross-disciplinary perspectives on meta-learning for algorithm selection
inferred← citeshttps://doi.org/10.1145/1529282.1529596openalex-snapshot
Message-passing and local heuristics as decimation strategies for satisfiability
inferred← citeshttps://doi.org/10.1145/2213977.2214058openalex-snapshot
Catching the k-NAESAT threshold
inferred← citeshttps://doi.org/10.1145/2591796.2591862openalex-snapshot
Satisfiability threshold for random regular NAE-SAT
inferred← citeshttps://doi.org/10.1145/2897518.2897584openalex-snapshot
Reed-Muller codes achieve capacity on erasure channels
inferred← citeshttps://doi.org/10.1145/2926791openalex-snapshot
A Model for Phase Transition of Random Answer-Set Programs
inferred← citeshttps://doi.org/10.1145/3005398openalex-snapshot
Belief Propagation Guided Decimation Fails on Random Formulas
inferred← citeshttps://doi.org/10.1145/3055399.3055420openalex-snapshot
Information-theoretic thresholds from the cavity method
inferred← citeshttps://doi.org/10.1145/3618260.3649781openalex-snapshot
Local Geometry of NAE-SAT Solutions in the Condensation Regime
inferred← citeshttps://doi.org/10.1145/3717823.3718124openalex-snapshot
Discrepancy Algorithms for the Binary Perceptron
showing the first 200 of 259 · page through all 259
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.