On the public citation graph
Quantum cooperative search algorithm for 3-SAT
0 signed · 31 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)1521-3978(199806)46:4/5<493::aid-prop493>3.0.co;2-popenalex-snapshot
Tight Bounds on Quantum Searching
inferredcites →https://doi.org/10.1007/bf00127077openalex-snapshot
Heuristic methods for evolutionary computation techniques
inferredcites →https://doi.org/10.1007/bf01011339openalex-snapshot
The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
inferredcites →https://doi.org/10.1007/bfb0040766openalex-snapshot
A superior evolutionary algorithm for 3-SAT
inferredcites →https://doi.org/10.1016/j.tcs.2014.05.025openalex-snapshot
Quantum cryptography: Public key distribution and coin tossing
inferredcites →https://doi.org/10.1070/rm1970v025n06abeh001269openalex-snapshot
THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
inferredcites →https://doi.org/10.1098/rspa.1985.0070openalex-snapshot
Quantum theory, the Church–Turing principle and the universal quantum computer
inferredcites →https://doi.org/10.1109/cec.2001.934274openalex-snapshot
Finding solutions to NP problems: philosophical differences between quantum and evolutionary search algorithms
inferredcites →https://doi.org/10.1109/jsac.2005.851157openalex-snapshot
Quantum communication for wireless wide-area networks
inferredcites →https://doi.org/10.1109/sfcs.1994.365700openalex-snapshot
Algorithms for quantum computation: discrete logarithms and factoring
inferredcites →https://doi.org/10.1109/tcsi.2005.856669openalex-snapshot
Quantum switching and quantum merge sorting
inferredcites →https://doi.org/10.1145/237814.237866openalex-snapshot
A fast quantum mechanical algorithm for database search
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0404146openalex-snapshot
Measurement-Based Quantum Turing Machines and their Universality
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-57249-4_18openalex-snapshot
A Parallel and Distributed Quantum SAT Solver Based on Entanglement and Teleportation
inferred← citeshttps://doi.org/10.1007/s10825-020-01489-3openalex-snapshot
Modifying quantum Grover’s algorithm for dynamic multi-pattern search on reconfigurable hardware
inferred← citeshttps://doi.org/10.1007/s11128-016-1464-zopenalex-snapshot
Subspace projection method for unstructured searches with noisy quantum oracles using a signal-based quantum emulation device
inferred← citeshttps://doi.org/10.1016/j.advengsoft.2022.103216openalex-snapshot
Engineering the development of quantum programs: Application to the Boolean satisfiability problem
inferred← citeshttps://doi.org/10.1016/j.engappai.2023.106058openalex-snapshot
Quantum hybrid algorithm for solving SAT problem
inferred← citeshttps://doi.org/10.1088/1361-6404/ae0f65openalex-snapshot
Solving equations approximately with Grover’s search algorithm
inferred← citeshttps://doi.org/10.1088/2058-9565/ad895copenalex-snapshot
Grover-QAOA for 3-SAT: quadratic speedup, fair-sampling, and parameter clustering
inferred← citeshttps://doi.org/10.1109/cicc.2017.7993631openalex-snapshot
Using quantum emulation for advanced computation
inferred← citeshttps://doi.org/10.1109/ecti-con64996.2025.11100698openalex-snapshot
A Benchmarking Study of Grover’s Algorithm for Solving Boolean SAT with Quantum Circuits
inferred← citeshttps://doi.org/10.1109/ismvl52857.2022.00012openalex-snapshot
Quantum Algorithm for Maximum Satisfiability
inferred← citeshttps://doi.org/10.1145/3579027.3608971openalex-snapshot
Quantum Computing for Feature Model Analysis
inferred← citeshttps://doi.org/10.20944/preprints202205.0112.v1openalex-snapshot
Fermat’s Last Theorem Proved in Hilbert Arithmetic. II. Its Proof in Hilbert Arithmetic by the Kochen-Specker Theorem With or Without Induction
inferred← citeshttps://doi.org/10.33774/coe-2022-9l6f8openalex-snapshot
Fermat’s last theorem proved in Hilbert arithmetic. II. Its proof in Hilbert arithmetic by the Kochen-Specker theorem with or without induction
inferred← citeshttps://doi.org/10.3390/e24111615openalex-snapshot
Quantum Algorithm for Variant Maximum Satisfiability
inferred← citeshttps://doi.org/10.3390/e26100875openalex-snapshot
Solving the B-SAT Problem Using Quantum Computing: Smaller Is Sometimes Better
inferred← citeshttps://doi.org/10.3390/math11081888openalex-snapshot
Heuristics for Quantum Computing Dealing with 3-SAT
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.