Sciweavers

73 search results - page 10 / 15
» On the Automatizability of Polynomial Calculus
Sort
View
ADCM
2011
14 years 6 months ago
The missing Wendland functions
Abstract: The Wendland radial basis functions [8, 9] are piecewise polynomial compactly supported reproducing kernels in Hilbert spaces which are norm–equivalent to Sobolev space...
Robert Schaback
ISSAC
2007
Springer
99views Mathematics» more  ISSAC 2007»
15 years 5 months ago
Computing monodromy via parallel homotopy continuation
Numerical homotopy continuation gives a powerful tool for the applied scientist who seeks solutions to a system of polynomial equations. Techniques from numerical homotopy continu...
Anton Leykin, Frank Sottile
ICLP
1997
Springer
15 years 3 months ago
The Complexity of Model Checking in Modal Event Calculi
Kowalski and Sergot’s Event Calculus (EC) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which propert...
Iliano Cervesato, Massimo Franceschet, Angelo Mont...
121
Voted
WOLLIC
2010
Springer
15 years 4 months ago
Reduction of the Intruder Deduction Problem into Equational Elementary Deduction for Electronic Purse Protocols with Blind Signa
Abstract. The intruder deduction problem for an electronic purse protocol with blind signatures is considered. The algebraic properties of the protocol are modeled by an equational...
Daniele Nantes Sobrinho, Mauricio Ayala-Rinc&oacut...
87
Voted
CSL
2005
Springer
15 years 5 months ago
A Propositional Proof System for Log Space
The proof system G∗ 0 of the quantified propositional calculus corresponds to NC1 , and G∗ 1 corresponds to P, but no formula-based proof system that corresponds log space rea...
Steven Perron