RANDOM
1997
Springer
13 years 11 months ago
1997
Springer
The current proof of the PCP Theorem (i.e., NP = PCP(log, O(1))) is very complicated. One source of difficulty is the technically involved analysis of low-degree tests. Here, we r...
MFCS
1997
Springer
13 years 11 months ago
1997
Springer
We prove an exponential lower bound for the length of any resolution proof for the same set of clauses as the one used by Urquhart [13]. Our contribution is a significant simpli...
MFCS
1997
Springer
13 years 11 months ago
1997
Springer
MFCS
1997
Springer
13 years 11 months ago
1997
Springer
The aim of this paper is an integration of graph grammars with different kinds of behavioural constraints, in particular with temporal logic constraints. Since the usual algebraic ...
MFCS
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. Kamperman and Walters proposed the notion of a simulation of one rewrite system by another one, whereby each term of the simulating rewrite system is related to a term in...
MFCS
1997
Springer
13 years 11 months ago
1997
Springer
It is important for programs to have modular correctness properties. We look at non-deterministic programs expressed as termrewriting systems which compute normal forms of input t...
ITICSE
1996
ACM
13 years 11 months ago
1996
ACM
Scientific visualization is becoming an important part of the curriculum in a number of disciplines. It is a very practical subject, but the commercially available visualization s...
ITICSE
1996
ACM
13 years 11 months ago
1996
ACM
The operation of a computer can be conceptualised as a large, discrete and constantly changing set of state information. However even for the simplest uni-processor the data set o...
ITICSE
1996
ACM
13 years 11 months ago
1996
ACM
ITICSE
1996
ACM
13 years 11 months ago
1996
ACM
