338 search results - page 14 / 68 » Locally checkable proofs |
CSR
2010
Springer
14 years 21 days ago
2010
Springer
Abstract. In this survey we compare the similarities, differences and the complexities of two very different approaches to solve a general constraint satisfaction probblems (CSP). ...
SIAMNUM
2010
13 years 2 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...
IEEEARES
2010
IEEE
13 years 5 months ago
2010
IEEE
Online auctions of governmental bonds and CO2 certificates are challenged by high availability requirements in face of high peak loads around the auction deadline. Traditionally, t...
APAL
2010
13 years 8 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...
LPAR
2000
Springer
13 years 11 months ago
2000
Springer
We propose a new tactic language for the system goq, which is intended to enrich the current tactic combinators (tacticals). This language is based on a functional core with recurs...