Results 1  10
of
47,339
A Perspective on Certain Polynomial Time Solvable Classes of Satisfiability
 Discrete Applied Mathematics
, 1998
"... The scope of certain wellstudied polynomialtime solvable classes of Satisfiability is investigated relative to a polynomialtime solvable class consisting of what we call matched formulas. The class of matched formulas has not been studied in the literature, probably because it seems not to contai ..."
Abstract

Cited by 20 (2 self)
 Add to MetaCart
The scope of certain wellstudied polynomialtime solvable classes of Satisfiability is investigated relative to a polynomialtime solvable class consisting of what we call matched formulas. The class of matched formulas has not been studied in the literature, probably because it seems
A Perspective on Certain Polynomial Time Solvable Classes of Satisfiability
"... Abstract The scope of certain wellstudied polynomialtime solvable classes of Satisfiability is investigated relative to a polynomialtime solvable class consisting of what we call matched formulas. The class of matched formulas has not been studied in the literature, probably because it seems not ..."
Abstract
 Add to MetaCart
Abstract The scope of certain wellstudied polynomialtime solvable classes of Satisfiability is investigated relative to a polynomialtime solvable class consisting of what we call matched formulas. The class of matched formulas has not been studied in the literature, probably because it seems
Analysis of the Deterministic Polynomial Time Solvability of the 01Knapsack Problem
, 2008
"... Previously the author has demonstrated that a representative polynomial search partition is required to solve a NPcomplete problem in deterministic polynomial time. It has also been demonstrated that finding such a partition can only be done in deterministic polynomial time if the form of the probl ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Previously the author has demonstrated that a representative polynomial search partition is required to solve a NPcomplete problem in deterministic polynomial time. It has also been demonstrated that finding such a partition can only be done in deterministic polynomial time if the form
Eisenberggale markets: Rationality, strongly polynomial time solvability and competition monotonicity
, 2006
"... We study the structure of EG[2], the class of EisenbergGale markets with two agents. We prove that all markets in this class are rational and they admit strongly polynomial algorithms whenever the polytope containing the set of feasible utilities of the two agents can be described via a combinatori ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We study the structure of EG[2], the class of EisenbergGale markets with two agents. We prove that all markets in this class are rational and they admit strongly polynomial algorithms whenever the polytope containing the set of feasible utilities of the two agents can be described via a
L&gpcsvea t « pyjsns reieoKSI Relative Size of Certain Polynomial Time Solvable Subclasses of Satisfiability
"... ABSTRACT. We determine, according to a certain measure, the relative sizes of several wellknown polynomially solvable subclasses of SAT. The measure we adopt is the probability that randomly selected fcSAT formulas belong to the subclass of formulas in question. This probability is a function of t ..."
Abstract
 Add to MetaCart
ABSTRACT. We determine, according to a certain measure, the relative sizes of several wellknown polynomially solvable subclasses of SAT. The measure we adopt is the probability that randomly selected fcSAT formulas belong to the subclass of formulas in question. This probability is a function
References
"... A perspective on certain polynomial time solvable classes of satisfiability. ..."
Abstract
 Add to MetaCart
A perspective on certain polynomial time solvable classes of satisfiability.
www.elsevier.com/locate/dsw Linearshaped partition problems
, 1999
"... We establish the polynomialtime solvability of a class of vector partition problems with linear objectives subject to ..."
Abstract
 Add to MetaCart
We establish the polynomialtime solvability of a class of vector partition problems with linear objectives subject to
Programming, pages 554–568, 1986.
"... [1] John Franco and Allen Van Gelder. A perspective on certain polynomial time solvable classes of satisfiability. ..."
Abstract
 Add to MetaCart
[1] John Franco and Allen Van Gelder. A perspective on certain polynomial time solvable classes of satisfiability.
Results 1  10
of
47,339