Sciweavers

173 search results - page 16 / 35
» Asymptotic classes of finite structures
Sort
View
CP
2000
Springer
13 years 11 months ago
Automatic Generation of Propagation Rules for Finite Domains
plexity Theorems: Talk Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 David McAllester Regular Papers Automatic Generation of Propagation Rules for F...
Slim Abdennadher, Christophe Rigotti
ECCC
2010
104views more  ECCC 2010»
13 years 7 months ago
Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields
In this paper we give the first construction of a pseudorandom generator, with seed length O(log n), for CC0[p], the class of constant-depth circuits with unbounded fan-in MODp ga...
Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka
SIAMMAX
2010
97views more  SIAMMAX 2010»
13 years 2 months ago
Krylov Subspace Methods for Linear Systems with Tensor Product Structure
The numerical solution of linear systems with certain tensor product structures is considered. Such structures arise, for example, from the finite element discretization of a line...
Daniel Kressner, Christine Tobler
ICSE
2007
IEEE-ACM
14 years 7 months ago
Korat: A Tool for Generating Structurally Complex Test Inputs
This paper describes the Korat tool for constraint-based generation of structurally complex test inputs for Java programs. Korat takes (1) an imperative predicate that specifies t...
Aleksandar Milicevic, Sasa Misailovic, Darko Marin...
CC
2002
Springer
126views System Software» more  CC 2002»
13 years 7 months ago
On the hardness of approximating the permanent of structured matrices
We show that for several natural classes of "structured" matrices, including symmetric, circulant, Hankel and Toeplitz matrices, approximating the permanent modulo a prim...
Bruno Codenotti, Igor Shparlinski, Arne Winterhof