Skip to search formSkip to main contentSkip to account menu

Richard Schroeppel

Known as: Rich Schroeppel, Richard C. Schroeppel, Schroeppel 
Richard C. Schroeppel (born 1948) is an American mathematician born in Illinois. His research has included magic squares, elliptic curves, and… 
Wikipedia (opens in a new tab)

Related topics

Related topics

4 relations
Counter machineCryptographyNegative baseSANDstorm hash

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
TREATMENT OF CARDAC TACHYARRHYTHMAS
5,749,900 A 5/1998 Schroeppel et al. 5,842,997 A 12/1998 Verrier et al. 5,921,940 A 7/1999 Verrier et al. 6,058.328 A 5, 2000… 
2012
2012
Solving Subset Sum Problems of Densioty close to 1 by "randomized" BKZ-reduction
Subset sum or Knapsack problems of dimension n are known to be hardest for knapsacks of density close to 1. These problems are NP… 
2010
2010
Magic determinants of Somos sequences and theta functions
2010
2010
A new generic algorithm for hard knapsacks ( preprint )
In this paper, we study the complexity of solving hard knapsack problems, especially knapsacks with a density close to 1 where… 
2009
2009
Table of Contents Introduction.............................................................................................................................................................2 � The XTS…
Introduction… 
2008
2008
Exploring Cipherspace: Combining stream ciphers and block ciphers
This paper looks at the possibility of combining a block cipher and a stream cipher to get a strong hybrid cipher. It includes… 
1993
1993
A Fast and General Implementation of Mach IPC in a Network
This paper describes an implementation of the Mach IPC abstraction on a network. Our implementation, called Mach NetIPC, is done… 
1992
1992
Parallel algorithms for NP-complete problems
The discovery of the NP-Complete problems has created a vigorous industry producing proofs of NP-Completeness. But does NP… 
1982
1982
Ein Effizienzvergleich der Faktorisierungsverfahren von Morrison-Brillhart und Schroeppel
ZusammenfassungDie Algorithmen von Morrison-Brillhart und Schroeppel sind für große natürliche Zahlen (allgemeiner Gestalt und… 
1982
1982
Ein Effizienzvergleich der Factorisierungsverfahren von Morrison-Brillhart und Schroeppel
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)