Sciweavers

3228 search results - page 532 / 646
» Computationally Sound Proofs
Sort
View
IPL
2007
111views more  IPL 2007»
13 years 8 months ago
Powering requires threshold depth 3
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...
Alexander A. Sherstov
JSCIC
2007
85views more  JSCIC 2007»
13 years 8 months ago
On Boundary Condition Capturing for Multiphase Interfaces
This paper begins with an overview of the boundary condition capturing approach to solving problems with interfaces. Although, the authors’ original motivation was to extend the...
Jeong-Mo Hong, Tamar Shinar, Myungjoo Kang, Ronald...
TCS
1998
13 years 8 months ago
Merit Factors and Morse Sequences
Abstract. We show that Turyn’s conjecture, arising from the Theory of Error Correcting Codes, has an equivalent formulation in Dynamical Systems Theory. In particular, Turyn’s ...
T. Downarowicz, Y. Lacroix
SAC
2008
ACM
13 years 8 months ago
UML-based design test generation
In this paper we investigate and propose a fully automated technique to perform conformance checking of Java implementations against UML class diagrams. In our approach, we reused...
Waldemar Pires, João Brunet, Franklin Ramal...
JACM
2010
116views more  JACM 2010»
13 years 7 months ago
The complexity of temporal constraint satisfaction problems
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
Manuel Bodirsky, Jan Kára