7106 search results - page 291 / 1422 » Restricted Complexity, General Complexity |
118
click to vote
CRYPTO
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We introduce new and general complexity theoretic hardumptions. These assumptions abstract out concrete properties of a random oracle and are significantly stronger than ...
148
click to vote
ECCC
2008
15 years 4 months ago
2008
We show analogues of a theorem due to Valiant and Vazirani [16] for intractable parameterized complexity classes such as W[P], W[SAT] and the classes of the W-hierarchy as well as...
124
click to vote
MP
2006
15 years 4 months ago
2006
In this paper, we provide theoretical analysis for a cubic regularization of Newton method as applied to unconstrained minimization problem. For this scheme, we prove general local...
144
click to vote
JALC
2007
15 years 4 months ago
2007
In this paper, we consider the enumeration of context-free languages. In particular, for any reasonable descriptional complexity measure for context-free grammars, we demonstrate ...
128
click to vote
LOGCOM
2007
15 years 4 months ago
2007
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...