Sciweavers

ECCC
2011
189views ECommerce» more  ECCC 2011»
13 years 6 months ago
Input-Oblivious Proof Systems and a Uniform Complexity Perspective on P/poly
An input-oblivious proof system is a proof system in which the proof does not depend on the claim being proved. Input-oblivious versions of NP and MA were introduced in passing by...
Oded Goldreich, Or Meir
COCO
2007
Springer
94views Algorithms» more  COCO 2007»
14 years 3 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
CIE
2010
Springer
14 years 4 months ago
Circuit Complexity and Multiplicative Complexity of Boolean Functions
In this note, we use lower bounds on Boolean multiplicative complexity to prove lower bounds on Boolean circuit complexity. We give a very simple proof of a 7n/3 − c lower bound ...
Arist Kojevnikov, Alexander S. Kulikov
ISLPED
2004
ACM
153views Hardware» more  ISLPED 2004»
14 years 4 months ago
Any-time probabilistic switching model using bayesian networks
Modeling and estimation of switching activities remain to be important problems in low-power design and fault analysis. A probabilistic Bayesian Network based switching model can ...
Shiva Shankar Ramani, Sanjukta Bhanja
LCPC
2005
Springer
14 years 5 months ago
Manipulating MAXLIVE for Spill-Free Register Allocation
Abstract. Many embedded systems use single-chip microcontrollers which have no on-chip RAM. In such a system, the processor registers must hold all live data values. Nanocontroller...
Shashi Deepa Arcot, Henry G. Dietz, Sarojini Priya...
CIE
2007
Springer
14 years 5 months ago
Circuit Complexity of Regular Languages
We survey our current knowledge of circuit complexity of regular languages and we prove that regular languages that are in AC0 and ACC0 are all computable by almost linear size ci...
Michal Koucký
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
15 years 1 days ago
On the complexity of communication complexity
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
Eyal Kushilevitz, Enav Weinreb