Padding argument

In computational complexity theory, the padding argument is a tool to conditionally prove that if some complexity classes are equal, then some other… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1990-2018
0119902018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
In this paper, we study FPGA based pipelined and superscalar design of two variants of conjugate gradient methods for solving… (More)
  • figure 2
  • figure 1
  • figure 5
  • figure 3
  • figure 6
Is this relevant?
2015
2015
In this paper, we propose a novel hybrid multiplicative-additive technique to reduce the peak-to-average power ratio (PAPR) in… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
2013
2013
With the development of the satellite communication, the relative velocity between the terminals is higher and caused larger the… (More)
  • figure 2
  • figure 1
  • figure 4
  • figure 5
  • figure 3
Is this relevant?
2012
2012
The efficiency of cork as a material dedicated to energy absorption under impact loading is studied in the present work. The… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
2011
2011
Multimedia data security is one of the crucial issues for resource-limited systems, such as PAD and smartphones, where some… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
2011
2011
As power-efficiency becomes paramount concern in processor design, architectures are coming up that completely do away with… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2005
2005
The classical Cooley-Tukey fast Fourier transform (FFT) algorithm has the computational cost of O(Nlog2N) where N is the length… (More)
  • figure 1
Is this relevant?
Highly Cited
2002
Highly Cited
2002
In many standards, e.g. SSL/TLS, IPSEC, WTLS, messages are first pre-formatted, then encrypted in CBC mode with a block cipher… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Combinational circuits are ojlen embedded in synchronous designs with rnernory elements at the input and output ports. A… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
1990
1990
In this paper we construct oracles relative to which DTIME( T(n)) equals NTIME( T(n)) and DTIME( t( n)) does not equal NTIME( t… (More)
Is this relevant?