4940 search results - page 564 / 988 » On the Complexity of Universal Programs |
191
click to vote
ISMVL
2000
IEEE
15 years 11 months ago
2000
IEEE
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
170
click to vote
ICSM
1998
IEEE
15 years 11 months ago
1998
IEEE
Code-based metrics such as coupling and cohesion are used to measure a system's structural complexity. But dealing with large systems--those consisting of several millions of...
187
click to vote
AGP
1994
IEEE
15 years 11 months ago
1994
IEEE
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
161
click to vote
ICALP
1994
Springer
15 years 11 months ago
1994
Springer
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
168
click to vote
ICALP
1992
Springer
15 years 11 months ago
1992
Springer
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...