Sciweavers

10718 search results - page 170 / 2144
» On the Circuit Implementation Problem
Sort
View
CIIA
2009
15 years 5 months ago
Physical Synthesis for CPLD Architectures
In this paper, we present a new synthesis feature namely, "Xor matching", and the foldback product term synthesis for Complex Programmable Logic Devices (CPLD) architectu...
Sid-Ahmed Senouci
COCO
2007
Springer
94views Algorithms» more  COCO 2007»
15 years 8 months ago
On Approximate Majority and Probabilistic Time
We prove new results on the circuit complexity of Approximate Majority, which is the problem of computing Majority of a given bit string whose fraction of 1's is bounded away...
Emanuele Viola
CAI
2005
Springer
15 years 3 months ago
Behavioural Equivalences on Finite-State Systems are PTIME-hard
The paper shows a logspace-reduction from the boolean circuit value problem which demonstrates that any relation subsuming bisimilarity and being subsumed by trace preorder (i.e.,...
Zdenek Sawa, Petr Jancar
DATE
2009
IEEE
106views Hardware» more  DATE 2009»
15 years 10 months ago
Optimal sizing of configurable devices to reduce variability in integrated circuits
This paper describes a systematic approach that facilitates yield improvement of integrated circuits at the post-manufacture stage. A new Configurable Analogue Transistor (CAT) st...
Peter Wilson, Reuben Wilcock
FSTTCS
2009
Springer
15 years 10 months ago
Arithmetic Circuits and the Hadamard Product of Polynomials
Motivated by the Hadamard product of matrices we define the Hadamard product of multivariate polynomials and study its arithmetic circuit and branching program complexity. We also...
Vikraman Arvind, Pushkar S. Joglekar, Srikanth Sri...