Sökning: "minimum circuit size problem"

Hittade 2 uppsatser innehållade orden minimum circuit size problem.

1. 1. Hardness of showing hardness of the minimum circuit size problem

   Master-uppsats, KTH/Teoretisk datalogi, TCS

   Författare :Emanuel Gedin; [2018]
   Nyckelord :computer science; theoretical computer science; complexity theory; minimum circuit size problem;

   Sammanfattning : The problem of finding the smallest size of a circuit that computes a given boolean function, usually referred to as the minimum circuit size problem (MCSP), has been studied for many years but it is still unknown whether or not the problem is NP-hard. With this in mind we study properties of potential reductions to this problem. LÄS MER

3. 2. Study of Timing Yield Optimization and Rectilinear Polygon Generation Algorithm

   Master-uppsats, KTH/Skolan för informations- och kommunikationsteknik (ICT)

   Författare :Cong Shen; [2011]
   Nyckelord :;

   Sammanfattning : With the decreasing of integrate circuit’s feature size, the process parameters of chips have serious variations. The process variations have severe influence on the timing analysis of integrate circuit. The precise modeling of process variations is the prerequisite of statistical timing analysis. LÄS MER