Filters
Show more
Show more
Show more
Show more
Show more
Show more
Show more
More filters
Results
Circuit complexity of regular languages
We survey our current knowledge of circuit complexity of regular languages. We show that regular languages are of interest as languages providing understanding of different circuit classes. We also prove that regular langua...
BA - Obecná matematika
- 2007 •
- D
Rok uplatnění
D - Stať ve sborníku
On the complexity of circuit satisfiability
We derive tight bounds on the exponent of the success probability for deciding the circuit satisfiability problem in a variety of probabilistic computational models under complexity asumptions....
BA - Obecná matematika
- 2010 •
- D
Rok uplatnění
D - Stať ve sborníku
FITTest_BENCH06: A New Set of Benchmark Circuits Reflecting Testability Properties
circuits at various levels of complexity (2000, 10000, 28000, 100000, 150000 and 300000 level of circuit complexity (fault coverage is approx. 0%, 33%, 66% and 100 circuits with required complexity
JC - Počítačový hardware a software
- 2006 •
- D
Rok uplatnění
D - Stať ve sborníku
Expansions of pseudofinite structures and circuit and proof complexity
I shall describe a general model-theoretic task to construct expansions of pseudofinite structures and discuss several examples of a particular relevance to computational complexity....
BA - Obecná matematika
- 2016 •
- C
Rok uplatnění
C - Kapitola v odborné knize
Circuits with medium fan-in
-On-Forehead model in communication complexity, or for bounded depth circuits in AC_0We consider boolean circuits in which every gate may compute an arbitrary ... that requires at least ... non-input gates when k = 2n/3. Wh...
BA - Obecná matematika
- 2015 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Diakoptic Method as a Generalized Form of the Thevenin's Theorem
. The diakoptic method allows solving complex electrical and electronic circuits. This method divides a complex electrical circuit into simpler circuits. The description of each of these circuits ...
Electrical and electronic engineering
- 2022 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Circuit complexity of regular languages
We survey the current state of knowledge on the circuit complexity of regular languages and we prove that regular languages that are in AC(0) and ACC(0) are all computable by almost linear size circuits, extending the resul...
BA - Obecná matematika
- 2009 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Diagonalization in proof complexity
We prove that (i) either there is a language in E requiring exponential circuit complexity, or (ii) the class NP is not closed under the complementation, or (iii) there is no p-optimal propositional proof system....
BA - Obecná matematika
- 2004 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Evolution of Synthetic RTL Benchmark Circuits with Predefined Testability
currently represent the most complex benchmark circuits with a known level in the area of digital-circuits testing. A method is described which enables to evolve large synthetic RTL benchmark circuits with a prede...
JC - Počítačový hardware a software
- 2008 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Analysis of electrical circuits with shielded coils
This paper deals with the useful way to analyze harmonic steady state of electric circuits with inductances that are electrically or magnetically shielded with conductive jacket. Parameters of shielded coils, so called complex self-...
Electrical and electronic engineering
- 2017 •
- JSC •
- Link
Rok uplatnění
JSC - Článek v periodiku v databázi SCOPUS
Výsledek na webu
- 1 - 10 out of 68 703