Sökning: "random circuit decomposition"

Hittade 2 avhandlingar innehållade orden random circuit decomposition.

1. 1. Random tournaments and random circuits

   Författare :Pontus Andersson; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematics; Poisson-Dirichlet distribution; random circuit decomposition; random tournament; subgraph count; MATEMATIK; MATHEMATICS; MATEMATIK; matematik; Mathematics;

   Sammanfattning : This thesis is devoted to two different topics in the area of probabilistic combinatorics: asymptotic behaviour of subgraph counts in a random tournament and random circuit decompositions of complete graphs.Let Tn be a random tournament on n vertices, chosen uniformly from all 2(n2) such tournaments, and let D be an arbitrary directed graph. LÄS MER

3. 2. All Around Logic Synthesis

   Författare :Maxim Teslenko; Hannu Tenhunen; Michel Berklaar; KTH; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; graph dominators; FPGA mapping; redundancy removal; RBN; Computer science; Datavetenskap;

   Sammanfattning : This dissertation is in the area of Computer-Aided Design (CAD) of digital Integrated Circuits (ICs). Today's digital ICs, such as microprocessors, memories, digital signal processors (DSPs), etc., range from a few thousands to billions of logic gates, flip-flops, and other components, packed in a few millimeters of area. LÄS MER