### Table 2. Simple Task Complex Task

"... In PAGE 5: ...22163 p = 0.8260 Top number : Least Squares Means Bottom number: p value Table2 below shows the mean values and the standard deviation of the data for the three versions of the glove for both the simple and the complex navigation path. Table 2.... ..."

### TABLE 2. Frontal Regions With Significant Activation Associated With Context Processing Task Variables in Patients With Schizophrenia, Patients With Nonschizophrenia Psychosis, and Healthy Comparison Subjectsa

### Table 5: Signi cant (P lt; 0.05, corrected for multiple comparisons) activation peak summary for the positive interaction effect of syllable complexity sequence complexity (seq syl). Left to right, columns show the size of contiguous clusters, the P-value for that cluster using combined cluter extent-voxel height inference, the P-value based only on cluster extent, and the voxel-wise P-value, pseudo-T value, MNI coordinates, and anatomical region label for activation peaks within the cluster. All P-values are corrected to control family-wise error.

"... In PAGE 15: ... The effects in the ventral premotor cortex, inferior frontal gyrus pars opercularis, and superior parietal lobe were signi - cantly (P lt; 0:05) left-lateralized. Table5 summarizes activations for the seq syl interaction. A further investigation of interactions between syl and seq is also available in the online supplemen- tary materials.... ..."

### Table 3: Summary of Definitions versus Key Questions

"... In PAGE 17: ... Similarly, the decision to flip a coin does not, in any way, change the task characteris- tics that are the source of objective complexity (definitions 11-13). Summary The matrix of questions and definitions is presented in Table3 . As made apparent by the pattern of responses to the questions posed, the five proposed classes, at a minimum, appear to be neces- sary for organizing the existing definitions.... ..."

### Table 1: Complexity results of con guration tasks

1998

"... In PAGE 6: ... Adding default negations to CRLr turns the decision problems EXISTS and QUERY NP-complete as we essentially then have the stable model semantics of normal logic programs. The discussion is summarized in Table1 . These complexity results can also be es- tablished from the complexity of the possible model semantics [SI94, EG95].... ..."

Cited by 2

### Table 1: Complexity results of con guration tasks

1998

"... In PAGE 6: ... Adding default negations to CRLr turns the decision problems EXISTS and QUERY NP-complete as we essentially then have the stable model semantics of normal logic programs. The discussion is summarized in Table1 . These complexity results can also be es- tablished from the complexity of the possible model semantics [SI94, EG95].... ..."

Cited by 2

### Table 2. Tasks, Their Complexity, and Amount of Code

"... In PAGE 12: ... On the other hand, the running times of Volcano (for queries not involving many joins) were quite low, as shown in [16]. The actual implementation tasks, their difficulty, and approximate number of lines of resulting code are summarized in Table2 .We divide the entire implementation effort into three subtasks.... ..."

### TABLE 1. Operational definition of task complexity.

2000

Cited by 25