2200 search results - page 57 / 440 » Bloch's Constant is Computable |
CIT
2006
Springer
15 years 1 months ago
2006
Springer
CA are useful tools in modeling and simulation. However, the more complex a CA is, the longer it takes to run in typical environments. A dedicated CA machine solves this problem by...
CAD
2005
Springer
14 years 9 months ago
2005
Springer
This paper presents a new and efficient algorithm for the decomposition of 3D arbitrary triangle meshes and particularly optimized triangulated CAD meshes. The algorithm is based ...
LATINCRYPT
2010
14 years 8 months ago
2010
A common scenario in many pairing-based cryptographic protocols is that one argument in the pairing is fixed as a long term secret key or a constant parameter in the system. In th...
DAC
2003
ACM
15 years 3 months ago
2003
ACM
Reduction of an extracted netlist is an important pre-processing step for techniques such as model order reduction in the design and analysis of VLSI circuits. This paper describe...
FOCS
2004
IEEE
15 years 1 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...