Sciweavers

10602 search results - page 78 / 2121
» Weakly Useful Sequences
Sort
View
FSTTCS
2010
Springer
13 years 7 months ago
On extracting computations from propositional proofs (a survey)
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
Pavel Pudlák
SIAMSC
2011
133views more  SIAMSC 2011»
13 years 4 months ago
On the Existence and the Applications of Modified Equations for Stochastic Differential Equations
In this paper we describe a general framework for deriving modified equations for stochastic differential equations with respect to weak convergence. Modified equations are deri...
K. C. Zygalakis
ASWEC
2008
IEEE
14 years 3 months ago
Modeling Input Validation in UML
Security is an integral part of most software systems but it is not considered as an explicit part in the development process yet. Input validation is the most critical part of so...
Pedram Hayati, Nastaran Jafari, S. Mohammad Rezaei...
ACISP
2003
Springer
14 years 2 months ago
New Constructions for Resilient and Highly Nonlinear Boolean Functions
Abstract. We explore three applications of geometric sequences in constructing cryptographic Boolean functions. First, we construct 1-resilient functions of n Boolean variables wit...
Khoongming Khoo, Guang Gong
EPIA
1995
Springer
14 years 24 days ago
Arguments and Defeat in Argument-Based Nonmonotonic Reasoning
Abstract. Argument-based formalisms are gaining popularity as models of nonmonotonic reasoning. Central in such formalisms is a notion of argument. Arguments are formal reconstruct...
Bart Verheij