Sciweavers

2233 search results - page 148 / 447
» On the Complexity of Theory Curbing
Sort
View
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
16 years 7 months ago
An axiomatic approach to algebrization
Non-relativization of complexity issues can be interpreted as giving some evidence that these issues cannot be resolved by "black-box" techniques. In the early 1990'...
Russell Impagliazzo, Valentine Kabanets, Antonina ...
ACL
1994
15 years 7 months ago
A Markov Language Learning Model for Finite Parameter Spaces
This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explici...
Partha Niyogi, Robert C. Berwick
CORR
2011
Springer
189views Education» more  CORR 2011»
15 years 1 months ago
Analysis of multi-stage open shop processing systems
We study algorithmic problems in multi-stage open shop processing systems that are centered around reachability and deadlock detection questions. We characterize safe and unsafe s...
Christian Eggermont, Alexander Schrijver, Gerhard ...
NC
2011
201views Neural Networks» more  NC 2011»
15 years 1 months ago
The computational power of membrane systems under tight uniformity conditions
We apply techniques from complexity theory to a model of biological cellular membranes known as membrane systems or P-systems. Like Boolean circuits, membrane systems are defined ...
Niall Murphy, Damien Woods
SIAMNUM
2011
124views more  SIAMNUM 2011»
15 years 1 months ago
Discrete Compactness for the p-Version of Discrete Differential Forms
In this paper we prove the discrete compactness property for a wide class of p finite element approximations of non-elliptic variational eigenvalue problems in two and three spac...
Daniele Boffi, Martin Costabel, Monique Dauge, Les...