Sciweavers

3208 search results - page 369 / 642
» A Lower Bound for Primality
Sort
View
CSR
2009
Springer
16 years 1 months ago
Depth Reduction for Circuits with a Single Layer of Modular Counting Gates
We consider the class of constant depth AND/OR circuits augmented with a layer of modular counting gates at the bottom layer, i.e AC0 ◦MODm circuits. We show that the following ...
Kristoffer Arnsfelt Hansen
ESA
2009
Springer
130views Algorithms» more  ESA 2009»
16 years 1 months ago
On the Performance of Approximate Equilibria in Congestion Games
We study the performance of approximate Nash equilibria for congestion games with polynomial latency functions. We consider how much the price of anarchy worsens and how much the ...
George Christodoulou, Elias Koutsoupias, Paul G. S...
FORMATS
2009
Springer
16 years 1 months ago
Realizability of Real-Time Logics
Abstract. We study the realizability problem for specifications of reactive systems expressed in real-time linear temporal logics. The logics we consider are subsets of MITL (Metr...
Laurent Doyen, Gilles Geeraerts, Jean-Franç...
FSTTCS
2009
Springer
16 years 1 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...
IWPEC
2009
Springer
16 years 1 months ago
The Parameterized Complexity of Some Geometric Problems in Unbounded Dimension
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
Panos Giannopoulos, Christian Knauer, Günter ...