Sciweavers

722 search results - page 20 / 73
» Efficient Generation of Prime Numbers
Sort
View
113 views 116 votes 15 years 4 months ago  ICGA 2008»
We present two new perfect hashing schemes that can be used for efficient bitboard move generation for sliding pieces in chess-like board games without the need to use rotated bit...
184 views 135 votes 16 years 4 months ago  TCC 2009»
We study the complexity of securely evaluating arithmetic circuits over finite rings. This question is motivated by natural secure computation tasks. Focusing mainly on the case o...
149 views 114 votes 15 years 8 months ago  ATS 2000»
We present a new pseudorandom testing algorithm for the Built-In Self-Test (BIST) of DRAM. In this algorithm, test patterns are complemented to generate state-transitions that are...
211 views 155 votes 15 years 8 months ago  ICCTA 2007»
We have carried out experimental research into implicit representation of large graphs using reduced ordered binary decision diagrams (OBDDs). We experimentally show that for grap...
236 views 145 votes 15 years 1 months ago  ECAI 2010»
Backbones of propositional theories are literals that are true in every model. Backbones have been used for characterizing the hardness of decision and optimization problems. Moreo...
145 views 134 votes 15 years 7 months ago  ASIACRYPT 2006»
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
134 views 154 votes 15 years 1 months ago  AOR 2010»
Column generation algorithms have been specially designed for solving mathematical programs with a huge number of variables. Unfortunately, this method suffers from slow convergen...
162 views 145 votes 15 years 8 months ago  ADBIS 2009»
Identification of all objects in a dataset whose similarity is not less than a specified threshold is of major importance for management, search, and analysis of data. Set similari...
111 views 124 votes 15 years 9 months ago  ANTS 2004»
We present a technique to recover f ∈ Q(ζp) where ζp is a primitive pth root of unity for a prime p, given its norm g = f ∗ ¯f in the totally real field Q(ζp + ζ−1 p )....
154 views 139 votes 15 years 2 months ago  IMCSIT 2010»
The portfolio optimization problem is modeled as a mean-risk bicriteria optimization problem where the expected return is maximized and some (scalar) risk measure is minimized. In ...