On the public citation graph

The Pure Literal Rule and Polynomial Average Time

https://doi.org/10.1137/0214067
0 signed · 52 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.1007/bf00288958openalex-snapshot
Backtracking with multi-level dynamic search rearrangement
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/0166-218x(83)90017-3openalex-snapshot
Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
inferredcites →https://doi.org/10.1016/s0004-3702(83)80007-1openalex-snapshot
Search rearrangement backtracking and polynomial average time
inferredcites →https://doi.org/10.1137/0210043openalex-snapshot
An Average Time Analysis of Backtracking
inferredcites →https://doi.org/10.1137/0212049openalex-snapshot
An Analysis of Backtracking with Search Rearrangement
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-46691-6_32openalex-snapshot
The Non-recursive Power of Erroneous Computation
inferred← citeshttps://doi.org/10.1007/3-540-50241-6_37openalex-snapshot
Optimization aspects of logical formulas
inferred← citeshttps://doi.org/10.1007/3-540-54945-5_55openalex-snapshot
An average case analysis of Monien and Speckenmeyer's mechanical theorem proving algorithm
inferred← citeshttps://doi.org/10.1007/3-540-58467-6_31openalex-snapshot
The hardest random SAT problems
inferred← citeshttps://doi.org/10.1007/3-540-64582-9_745openalex-snapshot
A Monte Carlo algorithm for the satisfiability problem
inferred← citeshttps://doi.org/10.1007/978-1-4612-1492-2_5openalex-snapshot
Parallel Algorithms for Satisfiability (SAT) Testing
inferred← citeshttps://doi.org/10.1007/978-1-4613-3629-7_6openalex-snapshot
Optimization Algorithms for the Satisfiability (SAT) Problem
inferred← citeshttps://doi.org/10.1007/978-1-4615-3422-8_31openalex-snapshot
Parallel Algorithms for NP-Complete Problems
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_7openalex-snapshot
Algorithms for the Satisfiability (SAT) Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-24840-8_23openalex-snapshot
Average Case Self-Duality of Monotone Boolean Functions
inferred← citeshttps://doi.org/10.1007/bf00881841openalex-snapshot
Resolving contradictions: A plausible semantics for inconsistent systems
inferred← citeshttps://doi.org/10.1007/bf01531028openalex-snapshot
Exact satisfiability, a natural extension of set partition, and its average case behavior
inferred← citeshttps://doi.org/10.1007/bf01531030openalex-snapshot
An average case analysis of a resolution principle algorithm in mechanical theorem proving
inferred← citeshttps://doi.org/10.1007/bf02186359openalex-snapshot
A selected artificial intelligence bibliography for operations researchers
inferred← citeshttps://doi.org/10.1007/bf02952482openalex-snapshot
On optimizing the satisfiability (SAT) problem
inferred← citeshttps://doi.org/10.1007/bfb0017176openalex-snapshot
Classes of cnf-formulas with backtracking trees of exponential or linear average order for exact-satisfiability
inferred← citeshttps://doi.org/10.1016/0004-3702(92)90107-9openalex-snapshot
Proving unsatisfiability for problems with constant cubic sparsity
inferred← citeshttps://doi.org/10.1016/0004-3702(94)90109-0openalex-snapshot
Easy problems are sometimes hard
inferred← citeshttps://doi.org/10.1016/0020-0190(86)90051-7openalex-snapshot
On the probabilistic performance of algorithms for the satisfiability problem
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90028-2openalex-snapshot
An exponential lower bound for the pure literal rule
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90160-wopenalex-snapshot
Counting propositional models
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90177-wopenalex-snapshot
Solving the satisfiability problem by using randomized approach
inferred← citeshttps://doi.org/10.1016/0020-0255(87)90003-xopenalex-snapshot
Polynomial-average-time satisfiability problems
inferred← citeshttps://doi.org/10.1016/0020-0255(90)90030-eopenalex-snapshot
Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiability problem
inferred← citeshttps://doi.org/10.1016/0020-0255(94)90032-9openalex-snapshot
Average time for the full pure literal rule
inferred← citeshttps://doi.org/10.1016/0166-218x(88)90121-7openalex-snapshot
Probabilistic performance of a heuristic for the satisfiability problem
inferred← citeshttps://doi.org/10.1016/0166-218x(90)90054-gopenalex-snapshot
On the occurrence of null clauses in random instances of satisfiability
inferred← citeshttps://doi.org/10.1016/0743-1066(93)90015-9openalex-snapshot
A simple test improves checking satisfiability
inferred← citeshttps://doi.org/10.1016/b978-0-12-386870-1.50019-8openalex-snapshot
Complementary Approaches to CNF Boolean Equations
inferred← citeshttps://doi.org/10.1016/s0004-3702(83)80007-1openalex-snapshot
Search rearrangement backtracking and polynomial average time
inferred← citeshttps://doi.org/10.1016/s0166-218x(99)00035-9openalex-snapshot
The Multi-SAT algorithm
inferred← citeshttps://doi.org/10.1017/cbo9780511780448.007openalex-snapshot
Probabilistic Analysis of Satisfiability Algorithms
inferred← citeshttps://doi.org/10.1023/a:1018992730285openalex-snapshot
Average case results for satisfiability algorithms under the random‐clause‐width model
inferred← citeshttps://doi.org/10.1080/095281300146326openalex-snapshot
Explaining by evidence
inferred← citeshttps://doi.org/10.1080/095281397147022openalex-snapshot
Approximate reasoning with credible subsets
inferred← citeshttps://doi.org/10.1109/12.485373openalex-snapshot
Convergence properties of optimization algorithms for the SAT problem
inferred← citeshttps://doi.org/10.1109/69.334864openalex-snapshot
Global optimization for satisfiability (SAT) problem
inferred← citeshttps://doi.org/10.1109/tpami.1984.4767555openalex-snapshot
Solving Satisfiability with Less Searching
inferred← citeshttps://doi.org/10.1137/0215080openalex-snapshot
Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem
inferred← citeshttps://doi.org/10.1137/0218026openalex-snapshot
CNF-Satisfiability Test by Counting and Polynomial Average Time
inferred← citeshttps://doi.org/10.1137/0218028openalex-snapshot
Exponential Average Time for the Pure Literal Rule
inferred← citeshttps://doi.org/10.1137/0220069openalex-snapshot
Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms
inferred← citeshttps://doi.org/10.1137/0222023openalex-snapshot
Average Time Analysis of Clause Order Backtracking
inferred← citeshttps://doi.org/10.1137/s0097539793256053openalex-snapshot
Probe Order Backtracking
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.