2446 search results - page 41 / 490 » Choiceless Polynomial Time |
ACISP
2007
Springer
14 years 1 months ago
2007
Springer
This paper improves the Finiasz-Vaudenay construction of TCHo, a hardware-oriented public-key cryptosystem, whose security relies on the hardness of finding a low-weight multiple ...
ESA
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual co...
FSTTCS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We consider exchange economies where the traders’ preferences are expressed in terms of the extensively used constant elasticity of substitution (CES) utility functions...
GD
2009
Springer
14 years 6 days ago
2009
Springer
A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is co...
COLT
2001
Springer
14 years 3 days ago
2001
Springer
We show that the class of monotone 2O( √ log n)-term DNF formulae can be PAC learned in polynomial time under the uniform distribution from random examples only. This is an expo...