The complexity of β-reduction in low orders

نویسنده

  • Aleksy Schubert
چکیده

We study the complexity of β-reduction for redexes of order 2, 3 and 4. The obtained results are: evaluation of boolean expressions can be reduced to β-reduction of order 2 and β-reduction of order 2 is in O(n log n), β-reduction of order 3 is complete for PTIME, and β-reduction of order 4 is complete for PSPACE.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Low Complexity Forward Error Correction for PAPR reduction in OFDM Systems

In this paper, a Peak to Average Power Ratio (PAPR) reduction technique in Orthogonal Frequency Division Multiplexing (OFDM) systems is proposed. This technique uses error correction capability of channel coding to reduce the PAPR.The coded bits at the input of OFDM modulator are separated into two groups of the Most Significant Bits (MSB) and the LeastSignificant Bits (LSB). The bits are mappe...

متن کامل

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

A new circuit model for the Parameters in equations of low power Hodgkin-Huxley neuron cell

In this paper, α and β parameters and gating variables equations of Hodgkin-Huxley neuron cell have been studied. Gating variables show opening and closing rate of ion flow of calcium and potassium in neuron cell. Variable functions α and β, are exponential functions in terms of u potential that have been obtained by Hodgkin and Huxley experimentally to adjust the equations of neural cells. In ...

متن کامل

A Depth-First Search Algorithm for Optimal Triangulation of Bayesian Network

Finding the triangulation of a Bayesian network with minimum total table size reduces the computational cost for probabilistic reasoning in the Bayesian network. This task can be done by conducting a search in the space of all possible elimination orders of the Bayesian network. However, such a search is known to be NP-hard. To relax this problem, Ottosen and Vomlel (2010b) proposed a depth-fir...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000