On the public citation graph
A superior evolutionary algorithm for 3-SAT
0 signed · 51 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.1007/978-3-7091-7535-4_76openalex-snapshot
A Clausal Genetic Representation and its Evolutionary Procedures for Satisfiability Problems
inferredcites →https://doi.org/10.1016/0004-3702(89)90008-8openalex-snapshot
A logical framework for depiction and image interpretation
inferredcites →https://doi.org/10.1023/a:1009638304510openalex-snapshot
Graph Coloring with Adaptive Evolutionary Algorithms
inferredcites →https://doi.org/10.1090/dimacs/026/21openalex-snapshot
Large plateaus and plateau search in Boolean satisfiability problems: When to give up searching and start again
inferredcites →https://doi.org/10.1090/dimacs/026/29openalex-snapshot
Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability
inferredcites →https://doi.org/10.1093/oso/9780195099713.001.0001openalex-snapshot
Evolutionary Algorithms in Theory and Practice
inferredcites →https://doi.org/10.1109/icec.1997.592273openalex-snapshot
Solving 3-SAT by GAs adapting constraint weights
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11731177_39openalex-snapshot
A Clonal Selection Algorithm for Coloring, Hitting Set and Satisfiability Problems
inferred← citeshttps://doi.org/10.1007/3-540-36131-6_37openalex-snapshot
An Immunological Approach to Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.1007/3-540-44652-4_71openalex-snapshot
A Genetic Algorithm for Satisfiability Problem in a Probabilistic Logic: A First Report
inferred← citeshttps://doi.org/10.1007/3-540-45356-3_61openalex-snapshot
Adaptive Fitness Functions for the Satisfiability Problem
inferred← citeshttps://doi.org/10.1007/3-540-45470-5_20openalex-snapshot
A Genetic-Based Approach for Satisfiability Problems
inferred← citeshttps://doi.org/10.1007/3-540-46033-0_10openalex-snapshot
The Effects of Partial Restarts in Evolutionary Search
inferred← citeshttps://doi.org/10.1007/3-540-48885-5_16openalex-snapshot
Adapting the Fitness Function in GP for Data Mining
inferred← citeshttps://doi.org/10.1007/978-3-540-24844-6_68openalex-snapshot
A Genetic Algorithm for Probabilistic SAT Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-02478-8_90openalex-snapshot
Evolutionary Genetic Algorithms in a Constraint Satisfaction Problem: Puzzle Eternity II
inferred← citeshttps://doi.org/10.1007/978-3-642-04843-2_27openalex-snapshot
Hybridizing Evolutionary Negative Selection Algorithm and Local Search for Large-Scale Satisfiability Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-20398-5_26openalex-snapshot
CORAL: Solving Complex Constraints for Symbolic PathFinder
inferred← citeshttps://doi.org/10.1007/978-3-642-38577-3_12openalex-snapshot
A Hybrid Genetic Algorithm for the Maximum Satisfiability Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-04448-3_2openalex-snapshot
Evolutionary Algorithms and Constraint Satisfaction: Definitions, Survey, Methodology, and Research Directions
inferred← citeshttps://doi.org/10.1007/978-3-662-43505-2_65openalex-snapshot
Evolutionary Computation and Constraint Satisfaction
inferred← citeshttps://doi.org/10.1007/bfb0056863openalex-snapshot
Solving binary constraint satisfaction problems using evolutionary algorithms with an adaptive fitness function
inferred← citeshttps://doi.org/10.1007/bfb0056917openalex-snapshot
Improving the performance of evolutionary algorithms for the satisfiability problem by refining functions
inferred← citeshttps://doi.org/10.1007/s10732-007-9023-5openalex-snapshot
Modelling the dynamics of stochastic local search on k-sat
inferred← citeshttps://doi.org/10.1007/s11334-010-0124-1openalex-snapshot
Randomized constraint solvers: a comparative study
inferred← citeshttps://doi.org/10.1016/j.jcss.2006.09.003openalex-snapshot
Quantum cooperative search algorithm for 3-SAT
inferred← citeshttps://doi.org/10.1016/s0375-9601(02)00067-1openalex-snapshot
Darwinism in quantum systems?
inferred← citeshttps://doi.org/10.1109/4235.771166openalex-snapshot
Parameter control in evolutionary algorithms
inferred← citeshttps://doi.org/10.1109/4235.942527openalex-snapshot
Parallel hybrid method for SAT that couples genetic algorithms and local search
inferred← citeshttps://doi.org/10.1109/cec.2001.934274openalex-snapshot
Finding solutions to NP problems: philosophical differences between quantum and evolutionary search algorithms
inferred← citeshttps://doi.org/10.1109/cec.2009.4983319openalex-snapshot
Evolutionary techniques in a constraint satisfaction problem: Puzzle Eternity II
inferred← citeshttps://doi.org/10.1109/icmlc.2014.7009141openalex-snapshot
Solving the maximum satisfiability problem by fuzzy converting it into a continuous optimization problem
inferred← citeshttps://doi.org/10.1109/icst.2012.91openalex-snapshot
Symbolic Execution with Interval Solving and Meta-heuristic Search
inferred← citeshttps://doi.org/10.1109/ines.2015.7329708openalex-snapshot
Solving the 3-SAT problem using genetic algorithms
inferred← citeshttps://doi.org/10.1109/iti.2003.1225388openalex-snapshot
An evolutionary framework for 3-SAT problems
inferred← citeshttps://doi.org/10.1109/tevc.2003.816584openalex-snapshot
Comparing evolutionary algorithms on binary constraint satisfaction problems
inferred← citeshttps://doi.org/10.1145/1068009.1068197openalex-snapshot
Advanced models of cellular genetic algorithms evaluated on SAT
inferred← citeshttps://doi.org/10.1145/1143997.1144005openalex-snapshot
Particle swarm with speciation and adaptation in a dynamic environment
inferred← citeshttps://doi.org/10.1145/335603.335912openalex-snapshot
An adaptive evolutionary algorithm for the satisfiability problem
inferred← citeshttps://doi.org/10.1162/106365602317301763openalex-snapshot
Evolutionary Algorithms for the Satisfiability Problem
inferred← citeshttps://doi.org/10.2498/cit.2003.03.06openalex-snapshot
An Evolutionary Framework for 3-SAT Problems
inferred← citeshttps://doi.org/10.3233/kes-2007-11202openalex-snapshot
On the application of linear transformations for genetic algorithms optimization
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0010021openalex-snapshot
Finding Solutions to NP Problems: Philosophical Difference Between Quantum and Evolutionary Search Algorithms
inferred← citeshttps://doi.org/10.48550/arxiv.quant-ph/0503176openalex-snapshot
Studies in the Theory of Quantum Games
inferred← citeshttps://doi.org/10.5772/6076openalex-snapshot
Recent Developments in Bit-Parallel Algorithms
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.