On the public citation graph
Probabilistic bounds and algorithms for the maximum satisfiability problem
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-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/978-3-642-85823-9openalex-snapshot
Boolean Methods in Operations Research and Related Areas
inferredcites →https://doi.org/10.1007/bf01874393openalex-snapshot
Probabilistic analysis of the pure literal heuristic for the satisfiability problem
inferredcites →https://doi.org/10.1007/bf02241270openalex-snapshot
Algorithms for the maximum satisfiability problem
inferredcites →https://doi.org/10.1007/bf02591742openalex-snapshot
Roof duality for polynomial 0–1 optimization
inferredcites →https://doi.org/10.1007/bf02612354openalex-snapshot
Roof duality, complementation and persistency in quadratic 0–1 optimization
inferredcites →https://doi.org/10.1016/0020-0190(79)90002-4openalex-snapshot
A linear-time algorithm for testing the truth of certain quantified boolean formulas
inferredcites →https://doi.org/10.1016/0020-0190(82)90110-7openalex-snapshot
Average time analysis of simplified Davis-Putnam procedures
inferredcites →https://doi.org/10.1016/0020-0190(86)90051-7openalex-snapshot
On the probabilistic performance of algorithms for the satisfiability problem
inferredcites →https://doi.org/10.1016/0020-0190(87)90028-7openalex-snapshot
On the complexity of the maximum satisfiability problem for horn formulas
inferredcites →https://doi.org/10.1016/0022-0000(88)90003-7openalex-snapshot
Probabilistic construction of deterministic algorithms: Approximating packing integer programs
inferredcites →https://doi.org/10.1016/0166-218x(83)90017-3openalex-snapshot
Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
inferredcites →https://doi.org/10.1016/0167-6377(88)90044-2openalex-snapshot
Resolution vs. cutting plane solution of inference problems: Some computational experience
inferredcites →https://doi.org/10.1016/0196-6774(82)90022-0openalex-snapshot
Algorithmic extremal problems in combinatorial optimization
inferredcites →https://doi.org/10.1016/0304-3975(76)90059-1openalex-snapshot
Some simplified NP-complete graph problems
inferredcites →https://doi.org/10.1016/0305-0548(86)90056-0openalex-snapshot
Some results and experiments in programming techniques for propositional logic
inferredcites →https://doi.org/10.1016/0377-2217(84)90231-5openalex-snapshot
A thermodynamically motivated simulation procedure for combinatorial optimization problems
inferredcites →https://doi.org/10.1016/s0022-0000(74)80044-9openalex-snapshot
Approximation algorithms for combinatorial problems
inferredcites →https://doi.org/10.1109/sfcs.1986.45openalex-snapshot
Probabilistic construction of deterministic algorithms: Approximating packing integer programs
inferredcites →https://doi.org/10.1137/0205048openalex-snapshot
On the Complexity of Timetable and Multicommodity Flow Problems
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/322248.322260openalex-snapshot
Complexity of Partial Satisfaction
inferredcites →https://doi.org/10.1145/48014.48016openalex-snapshot
Many hard examples for resolution
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
inferredcites →https://doi.org/10.1287/moor.14.2.317openalex-snapshot
Closed Form Two-Sided Bounds for Probabilities that At Least r and Exactly r Out of n Events Occur
inferredcites →https://doi.org/10.1287/opre.36.1.145openalex-snapshot
Boole-Bonferroni Inequalities and Linear Programming
inferredcites →https://doi.org/10.1287/opre.38.2.227openalex-snapshot
Sharp Bounds on Probabilities Using Linear Programming
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jctb.2001.2037openalex-snapshot
Covering Non-uniform Hypergraphs
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_273openalex-snapshot
Maximum Constraint Satisfaction: Relaxations and Upper Bounds
inferred← citeshttps://doi.org/10.1007/0-387-25383-1_1openalex-snapshot
Metaheuristic Agent Processes (MAPS)
inferred← citeshttps://doi.org/10.1007/0-387-29550-x_4openalex-snapshot
A Unified Framework for Modeling and Solving Combinatorial Optimization Problems: A Tutorial
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_15openalex-snapshot
Binary Unconstrained Quadratic Optimization Problem
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_15-1openalex-snapshot
QUBO: Quadratic Unconstrained Binary Optimization Problem
inferred← citeshttps://doi.org/10.1007/978-981-13-0872-7_11openalex-snapshot
Empirical Analysis of Probabilistic Bounds
inferred← citeshttps://doi.org/10.1007/s00291-003-0153-3openalex-snapshot
A unified modeling and solution framework for combinatorial optimization problems
inferred← citeshttps://doi.org/10.1007/s10479-005-3449-7openalex-snapshot
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem
inferred← citeshttps://doi.org/10.1007/s10479-015-1995-1openalex-snapshot
On the relationship between the discrete and continuous bounding moment problems and their numerical solutions
inferred← citeshttps://doi.org/10.1007/s10479-017-2629-6openalex-snapshot
Bounds for the probability of the union of events with unimodality
inferred← citeshttps://doi.org/10.1007/s10479-022-04789-yopenalex-snapshot
The value of shape constraints in discrete moment problems: a review and extension
inferred← citeshttps://doi.org/10.1007/s10589-016-9844-yopenalex-snapshot
Building an iterative heuristic solver for a quantum annealer
inferred← citeshttps://doi.org/10.1007/s10732-007-9009-3openalex-snapshot
Local search heuristics for Quadratic Unconstrained Binary Optimization (QUBO)
inferred← citeshttps://doi.org/10.1007/s11081-019-09442-5openalex-snapshot
Sharp bounds for the probability of union of n events when m number of binomial moments are known
inferred← citeshttps://doi.org/10.1016/j.dam.2017.01.035openalex-snapshot
Bounds for the probability of union of events following monotonic distribution
inferred← citeshttps://doi.org/10.1016/j.dam.2017.03.011openalex-snapshot
New bounds for the probability that at least k -out-of- n events occur with unimodal distributions
inferred← citeshttps://doi.org/10.1016/j.orl.2015.10.004openalex-snapshot
Improved bounds on the probability of the union of events some of whose intersections are empty
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00341-9openalex-snapshot
Pseudo-Boolean optimization
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00031-1openalex-snapshot
Maximum renamable Horn sub-CNFs
inferred← citeshttps://doi.org/10.1137/100802190openalex-snapshot
Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs
inferred← citeshttps://doi.org/10.1287/opre.38.2.227openalex-snapshot
Sharp Bounds on Probabilities Using Linear Programming
inferred← citeshttps://doi.org/10.26421/qic16.11-12-6openalex-snapshot
Solving constrained quadratic binary problems via quantum adiabatic evolution
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.