173 search results - page 13 / 35 » A Proof of the Two-path Conjecture |
CP
2006
Springer
15 years 3 months ago
2006
Springer
The problem of finding a graceful labelling of a graph, or proving that the graph is not graceful, has previously been modelled as a CSP. A new and much faster CSP model of the pro...
ENDM
2010
14 years 12 months ago
2010
The performance of Branch-and-Bound algorithms is severely impaired by the presence of symmetric optima in a given problem. We describe a method for the automatic detection of for...
JGT
2007
14 years 11 months ago
2007
A 3-uniform hypergraph is called a minimum 3-tree, if for any 3-coloring of its vertex set there is a heterochromatic triple and the hypergraph has the minimum possible number of ...
126
click to vote
FOCS
1999
IEEE
15 years 4 months ago
1999
IEEE
This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former syste...
APAL
2010
14 years 12 months ago
2010
Classical proof forests are a proof formalism for first-order classical logic based on Herbrand's Theorem and backtracking games in the style of Coquand. First described by M...