649 search results - page 13 / 130 » An Improved Construction of Progression-Free Sets |
SODA
2012
ACM
13 years 16 days ago
2012
ACM
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our resu...
CAD
2008
Springer
14 years 10 months ago
2008
Springer
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
FOCS
1999
IEEE
15 years 2 months ago
1999
IEEE
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
74
Voted
BMCBI
2006
14 years 10 months ago
2006
Background: Many proteomics initiatives require integration of all information with uniformcriteria from collection of samples and data display to publication of experimental resu...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...