John V. Franco

Available identifiers

zbMath Open franco.john-vMaRDI QIDQ673601

List of research outcomes

Publication	Date of Publication	Type
Computing the well-founded semantics faster	2022-08-30	Paper
https://portal.mardi4nfdi.de/entity/Q3145805	2012-12-23	Paper
https://portal.mardi4nfdi.de/entity/Q3081621	2011-03-09	Paper
Theory and Applications of Satisfiability Testing	2009-07-24	Paper
https://portal.mardi4nfdi.de/entity/Q3507034	2008-06-18	Paper
A sharp threshold for the renameable-Horn and the \(q\)-Horn properties	2006-01-10	Paper
Typical case complexity of satisfiability algorithms and the threshold phenomenon	2006-01-10	Paper
Theory and Applications of Satisfiability Testing	2005-12-15	Paper
On good algorithms for determining unsatisfiability of propositional formulas	2003-09-15	Paper
A perspective on certain polynomial-time solvable classes of satisfiability	2003-03-09	Paper
Some interesting research directions in satisfiability	2002-06-27	Paper
Results related to threshold phenomena research in satisfiability: Lower bounds	2002-03-03	Paper
https://portal.mardi4nfdi.de/entity/Q4527191	2001-06-05	Paper
An algorithm for the class of pure implicational formulas	2000-01-17	Paper
The probability of pure literals	1999-10-31	Paper
https://portal.mardi4nfdi.de/entity/Q4375759	1998-06-02	Paper
https://portal.mardi4nfdi.de/entity/Q4375757	1998-03-02	Paper
Average case results for satisfiability algorithms under the random-clause-width model	1997-10-26	Paper
Recent work at the interface of logic, combinatorics, and computer science	1997-05-13	Paper
On finding solutions for extended Horn formulas	1997-02-28	Paper
Unique satisfiability of Horn sets can be solved in nearly linear time	1995-09-06	Paper
Work-preserving emulations of shuffle-exchange networks: An analysis of the complex plane diagram	1995-07-24	Paper
On the occurence of null clauses in random instances of Satisfiability	1993-05-16	Paper
The analysis of hashing with lazy deletions	1992-06-28	Paper
Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms	1992-06-27	Paper
Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k-satisfiability problem	1990-01-01	Paper
Probabilistic performance of a heurisic for the satisfiability problem	1988-01-01	Paper
Correction to ``Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem	1987-01-01	Paper
Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem	1986-01-01	Paper
An approximation algorithm for the maximum independent set problem in cubic planar graphs	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3827800	1984-01-01	Paper
Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem	1983-01-01	Paper

Research outcomes over time

This page was built for person: John V. Franco