99
Voted
COCO
2006
Springer
15 years 7 months ago
2006
Springer
We may believe SAT does not have small Boolean circuits. But is it possible that some language with small circuits looks indistiguishable from SAT to every polynomialtime bounded ...
118
click to vote
COCO
2006
Springer
15 years 7 months ago
2006
Springer
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis. We show that both hinge on the question of understanding the...
156
click to vote
FASE
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. This paper presents a systematic consideration of the major issues involved in translation of executable design level software specification languages to directly model-c...
130
click to vote
COCO
2006
Springer
15 years 7 months ago
2006
Springer
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...
201
click to vote
FASE
2004
Springer
15 years 7 months ago
2004
Springer
Real-Time Maude is a language and tool supporting the formal specification and analysis of real-time and hybrid systems. The specification formalism is based on rewriting logic, em...