Sciweavers

16666 search results - page 195 / 3334
» Descriptive and Computational Complexity
Sort
View
DAGSTUHL
2006
15 years 5 months ago
A note on the size of Craig Interpolants
Mundici considered the question of whether the interpolant of two propositional formulas of the form F G can always have a short circuit description, and showed that if this is t...
Uwe Schöning, Jacobo Torán
ALT
2003
Springer
16 years 1 months ago
Intrinsic Complexity of Uniform Learning
Inductive inference is concerned with algorithmic learning of recursive functions. In the model of learning in the limit a learner successful for a class of recursive functions mus...
Sandra Zilles
BIBE
2007
IEEE
149views Bioinformatics» more  BIBE 2007»
15 years 8 months ago
XML Encoding of Features Describing Rule-Based Modeling of Reaction Networks with Multi-Component Molecular Complexes
Multi-state molecules and multi-component complexes are commonly involved in cellular signaling. Accounting for molecules that have multiple potential states, such as a protein tha...
Michael L. Blinov, Ion I. Moraru
ESEM
2010
ACM
15 years 2 months ago
Introducing the evaluation of complexity in functional size measurement: a UML-based approach
Functional Size Measures are often used for effort estimation. However, these measures do not take into account the amount and complexity of elaboration required, concentrating in...
Luigi Lavazza, Gabriela Robiolo
PODS
2008
ACM
141views Database» more  PODS 2008»
16 years 4 months ago
On the complexity of deriving schema mappings from database instances
We introduce a theoretical framework for discovering relationships between two database instances over distinct and unknown schemata. This framework is grounded in the context of ...
Pierre Senellart, Georg Gottlob