352 search results - page 11 / 71 » Proofs as Polynomials |
DM
1998
13 years 6 months ago
1998
In this paper a polynomial algorithm for the prime factorization of finite, connected nonbipartite graphs with respect to the cardinal product is presented. This algorithm also d...
SIAMNUM
2010
13 years 1 months ago
2010
In this paper, we study the superconvergence property for the discontinuous Galerkin (DG) and the local discontinuous Galerkin (LDG) methods, for solving one-dimensional time depe...
ENTCS
2006
13 years 6 months ago
2006
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
SIAMCOMP
2000
13 years 6 months ago
2000
An exponential lower bound for the size of tree-like cutting planes refutations of a certain family of conjunctive normal form (CNF) formulas with polynomial size resolution refuta...
COMBINATORICS
2006
13 years 6 months ago
2006
In the game of Penney Ante two players take turns publicly selecting two distinct words of length n using letters from an alphabet of size q. They roll a fair q sided die having ...