1225 search results - page 68 / 245 » The Instance Complexity Conjecture |
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
ASIACRYPT
2003
Springer
14 years 2 months ago
2003
Springer
In this paper1 we propose a new symmetric block cipher with the following paradoxical traceability properties: it is computationally easy to derive many equivalent secret keys prov...
SYNTHESE
2008
13 years 9 months ago
2008
Many philosophers think that, necessarily, any material objects have a fusion (let's call that doctrine "Universalism"). In this paper I point out a couple of strang...
COMPGEOM
2008
ACM
13 years 10 months ago
2008
ACM
Manifold reconstruction has been extensively studied for the last decade or so, especially in two and three dimensions. Recent advances in higher dimensions have led to new method...
PPL
2010
13 years 7 months ago
2010
Rank-varying computational complexity describes those computations in which the complexity of executing each step is not a constant, but evolves throughout the computation as a fu...