On the public citation graph
MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in $\mathcal{O}(2^n)$ Time
0 signed · 39 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.1006/jagm.1998.0996openalex-snapshot
Parameterizing above Guaranteed Values: MaxSat and MaxCut
inferredcites →https://doi.org/10.1006/jagm.2000.1075openalex-snapshot
New Upper Bounds for Maximum Satisfiability
inferredcites →https://doi.org/10.1006/jcss.1997.1490openalex-snapshot
On Fixed-Parameter Tractability and Approximability of NP Optimization Problems
inferredcites →https://doi.org/10.1007/3-540-46632-0_26openalex-snapshot
Upper Bounds for MaxSat: Further Improved
inferredcites →https://doi.org/10.1007/978-3-540-24587-2_19openalex-snapshot
The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems
inferredcites →https://doi.org/10.1007/978-3-540-24605-3_25openalex-snapshot
On Computing k-CNF Formula Properties
inferredcites →https://doi.org/10.1016/j.dam.2003.03.002openalex-snapshot
Improved exact algorithms for MAX-SAT
inferredcites →https://doi.org/10.1016/s0166-218x(02)00404-3openalex-snapshot
Worst-case study of local search for MAX-k-SAT
inferredcites →https://doi.org/10.1016/s0168-0072(01)00052-5openalex-snapshot
MAX SAT approximation beyond the limits of polynomial-time approximation
inferredcites →https://doi.org/10.1016/s1571-0661(04)80663-7openalex-snapshot
Exact Algorithms for MAX-SAT
inferredcites →https://doi.org/10.1063/1.4822863openalex-snapshot
Concrete Mathematics: A Foundation for Computer Science
inferredcites →https://doi.org/10.1109/ccc.2003.1214425openalex-snapshot
Memoization and DPLL: formula caching proof systems
inferredcites →https://doi.org/10.1109/sfcs.1997.646129openalex-snapshot
A 7/8-approximation algorithm for MAX 3SAT?
inferredcites →https://doi.org/10.2307/2324448openalex-snapshot
Concrete Mathematics: A Foundation for Computer Science.
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-0-387-30162-4_227openalex-snapshot
Maximum Two-Satisfiability
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_227openalex-snapshot
Exact Algorithms for Maximum Two-Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-319-09284-3_4openalex-snapshot
Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction
inferred← citeshttps://doi.org/10.1007/978-3-319-24318-4_4openalex-snapshot
Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP
inferred← citeshttps://doi.org/10.1007/978-3-540-74510-5_21openalex-snapshot
New Bounds for MAX-SAT by Clause Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-27848-8_227-2openalex-snapshot
Exact Algorithms for Maximum Two-Satisfiability
inferred← citeshttps://doi.org/10.1007/978-3-642-28050-4_9openalex-snapshot
New Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree
inferred← citeshttps://doi.org/10.1007/978-3-642-40313-2_43openalex-snapshot
Solving 3-Superstring in 3 n/3 Time
inferred← citeshttps://doi.org/10.1007/s00224-014-9600-6openalex-snapshot
Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction
inferred← citeshttps://doi.org/10.1007/s10958-012-1101-zopenalex-snapshot
A new upper bound for (n, 3)-MAX-SAT
inferred← citeshttps://doi.org/10.1016/j.ipl.2014.03.004openalex-snapshot
Solving SCS for bounded length strings in fewer than steps
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.01.010openalex-snapshot
New exact algorithms for the 2-constraint satisfaction problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.07.011openalex-snapshot
Improved exact algorithms for mildly sparse instances of Max SAT
inferred← citeshttps://doi.org/10.1109/focs.2013.58openalex-snapshot
A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits
inferred← citeshttps://doi.org/10.1109/focs.2015.14openalex-snapshot
Tight Hardness Results for LCS and Other Sequence Similarity Measures
inferred← citeshttps://doi.org/10.1109/focs.2016.57openalex-snapshot
Polynomial Representations of Threshold Functions and Algorithmic Applications
inferred← citeshttps://doi.org/10.1515/dma.2009.009openalex-snapshot
New upper bounds for the problem of maximal satisfiability
inferred← citeshttps://doi.org/10.1587/transinf.2014edp7127openalex-snapshot
A Satisfiability Algorithm for Some Class of Dense Depth Two Threshold Circuits
inferred← citeshttps://doi.org/10.3233/978-1-61499-419-0-453openalex-snapshot
Progression in Maximum Satisfiability
inferred← citeshttps://doi.org/10.4213/dm1043openalex-snapshot
Новые верхние оценки для задачи максимальной выполнимости
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2019.8openalex-snapshot
A #SAT Algorithm for Small Constant-Depth Circuits with PTF Gates
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2020.83openalex-snapshot
OV Graphs Are (Probably) Hard Instances
inferred← citeshttps://doi.org/10.48550/arxiv.1212.4548openalex-snapshot
A Satisfiability Algorithm for Sparse Depth Two Threshold Circuits
inferred← citeshttps://doi.org/10.48550/arxiv.1501.07053openalex-snapshot
Quadratic-Time Hardness of LCS and other Sequence Similarity Measures
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.