Sciweavers

245 search results - page 18 / 49
» On the Average-Case Complexity of Property Testing
Sort
View
STOC
2004
ACM
94views Algorithms» more  STOC 2004»
15 years 12 months ago
Sublinear algorithms for testing monotone and unimodal distributions
The complexity of testing properties of monotone and unimodal distributions, when given access only to samples of the distribution, is investigated. Two kinds of sublineartime alg...
Tugkan Batu, Ravi Kumar, Ronitt Rubinfeld
AI
2005
Springer
14 years 11 months ago
: Compiling problem specifications into SAT
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...
Marco Cadoli, Andrea Schaerf
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
15 years 6 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret
CCE
2005
14 years 11 months ago
CFD analyses of complex flows
Computational fluid dynamics (CFD) of complex processes and complicated geometries embraces the transport of momentum, heat, and mass including the description of reaction kinetic...
Richard Farmer, Ralph Pike, Gary Cheng
CRYPTO
2008
Springer
186views Cryptology» more  CRYPTO 2008»
15 years 1 months ago
Communication Complexity in Algebraic Two-Party Protocols
In cryptography, there has been tremendous success in building various two-party protocols with small communication complexity out of homomorphic semantically-secure encryption sc...
Rafail Ostrovsky, William E. Skeith III