On the public citation graph

A spectral technique for random satisfiable 3CNF formulas

0 signed · 35 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/0471722154openalex-snapshot
The Probabilistic Method
inferredcites →https://doi.org/10.1002/rsa.20089openalex-snapshot
Spectral techniques applied to sparse random graphs
inferredcites →https://doi.org/10.1007/3-540-45446-2_21openalex-snapshot
Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold
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.1007/3-540-48224-5_26openalex-snapshot
Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently
inferredcites →https://doi.org/10.1007/3-540-61310-2_26openalex-snapshot
Coloring bipartite hypergraphs
inferredcites →https://doi.org/10.1007/s00493-005-0017-3openalex-snapshot
Random k-Sat: A Tight Threshold For Moderately Growing k
inferredcites →https://doi.org/10.1016/0004-3702(95)00046-1openalex-snapshot
Experimental results on the crossover point in random 3-SAT
inferredcites →https://doi.org/10.1016/0020-0190(92)90029-uopenalex-snapshot
On the greedy algorithm for satisfiability
inferredcites →https://doi.org/10.1016/0378-4754(89)90164-xopenalex-snapshot
Linear algebra and its applications
inferredcites →https://doi.org/10.1016/c2009-0-09109-0openalex-snapshot
Combinatorial Problems and Exercises
inferredcites →https://doi.org/10.1017/cbo9781107359949.008openalex-snapshot
On the method of bounded differences
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/physrevlett.88.188701openalex-snapshot
Hiding Solutions in Random Satisfiability Problems: A Statistical Mechanics Approach
inferredcites →https://doi.org/10.1109/sffcs.1999.814612openalex-snapshot
A probabilistic algorithm for k-SAT and constraint satisfaction problems
inferredcites →https://doi.org/10.1145/301250.301392openalex-snapshot
Short proofs are narrow—resolution made simple
inferredcites →https://doi.org/10.1145/375827.375835openalex-snapshot
Short proofs are narrow—resolution made simple
inferredcites →https://doi.org/10.1145/48014.48016openalex-snapshot
Many hard examples for resolution
inferredcites →https://doi.org/10.1145/509907.509985openalex-snapshot
Relations between average case complexity and approximation complexity
inferredcites →https://doi.org/10.1145/509984.509985openalex-snapshot
Relations between average case complexity and approximation complexity
inferredcites →https://doi.org/10.1145/73007.73063openalex-snapshot
On the second eigenvalue of random regular graphs
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.5555/644108.644166openalex-snapshot
A spectral technique for random satisfiable 3CNF formulas

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/rsa.20116openalex-snapshot
A spectral heuristic for bisecting random graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-80223-3_13openalex-snapshot
Solving Non-uniform Planted and Filtered Random SAT Formulas Greedily
inferred← citeshttps://doi.org/10.1007/s00037-015-0121-8openalex-snapshot
Cryptographic Hardness of Random Local Functions
inferred← citeshttps://doi.org/10.1007/s00453-016-0190-3openalex-snapshot
Time Complexity Analysis of Evolutionary Algorithms on Random Satisfiable k-CNF Formulas
inferred← citeshttps://doi.org/10.1017/s096354830600784xopenalex-snapshot
Strong Refutation Heuristics for Random k -SAT
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238204openalex-snapshot
More on average case vs approximation complexity
inferred← citeshttps://doi.org/10.1137/070699354openalex-snapshot
Finding Planted Partitions in Random Graphs with General Degree Distributions
inferred← citeshttps://doi.org/10.3233/sat190033openalex-snapshot
It’s All about the Support: A New Perspective on the Satisfiability Problem
inferred← citeshttps://doi.org/10.4086/toc.2013.v009a019openalex-snapshot
inferred← citeshttps://doi.org/10.4204/eptcs.9.4openalex-snapshot
Random Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.46298/dmtcs.3538openalex-snapshot
Why almost all satisfiable $k$-CNF formulas are easy
inferred← citeshttps://doi.org/10.46298/dmtcs.3546openalex-snapshot
Message passing for the coloring problem: Gallager meets Alon and Kahale
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.