Deterministic summation modulo ℬn, the semigroup of binary relations on {0, 1,..., n - 1}

Theoretical Computer Science

Volumn 172, Issue 1-2, 1997, Pages 135-174

  Handley, W G ^a  

^a UNIVERSITY OF BATH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEQUENCES; BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; SET THEORY; SHIFT REGISTERS;

BINARY RELATIONS; DETERMINISTIC SUMMATION MODULO;

COMPUTATION THEORY;

EID: 0031070848     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(95)00245-6     Document Type: Article

References (22)

1. M. Ajtai, Parity and the pigeonhole principle, in: S.R. Buss and P.J. Scott, eds., Feasible Mathematics (Birkhäuser, Basel, 1990) 1-24.
2. 1, J. Comput. System Sci. 38 (1989) 150-164.
3. A.P. Bel'tyukov, A machine description and the hierarchy of initial Grzegorczyk classes, J. Soviet Math. 20 (1982) 2280-2289; translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V.A. Steklova AN SSR, Vol. 88 (1979) 30-46.
4. A.P. Bel'tyukov, A machine description and the hierarchy of initial Grzegorczyk classes, J. Soviet Math. 20 (1982) 2280-2289; translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V.A. Steklova AN SSR, Vol. 88 (1979) 30-46.
5. J.H. Bennett, On spectra, Ph.D. Thesis, Department of Mathematics, Princeton University, 1962.
6. S.R. Buss, Bounded arithmetic, Studies in Proof Theory (Bibliopolis, Napoli, 1986), revision of 1985 Princeton Ph.D. Thesis.
7. A.K. Chandra, D.C. Kozen and L.J. Stockmeyer, Alternation, J. ACM 28 (1981) 114-133.
8. A.H. Clifford and G.B. Preston, The Algebraic Theory of Semigroups, Mathematical Surveys, Vol. 7 (American Mathematical Society, Providence, RI, 2nd (1964) ed., 1961).
9. P. Clote, Nondeterministic stack register machines, Theoret. Comput. Sci., submitted.
10. 0, Ph.D. Thesis, Department of Mathematics, University of Manchester, 1986.
11. n, the semigroup of binary relations on {0, 1,..., n - 1}, Theoret. Compnt. Sci., accepted.
12. W.G. Handley, Nondeterministic summation mod the semigroup of pregraphs over {0, 1, 2} yields ALINTIME, December 1994.
13. 3, the semigroup of functions on {0, 1, 2}, submitted.
14. 4, the semigroup of functions on {0, 1, 2, 3}, September 1994.
15. K. Harrow, The bounded arithmetic hierarchy, Inform. and Control 36 (1978) 102-117.
16. J.B. Paris, W.G. Handley and A.J. Wilkie, Characterizing some low arithmetic classes, in: Colloquia Mathematica Societatis Jànos Bolyai 44, Hungary (1984) 353-364.
17. J. Paris and A. Wilkie, Counting problems in bounded arithmetic, in: C.A. di Prisco, ed., Proc. VIth Latin American, Logic Conf. Caracus, Venezuela, Lecture Notes in Mathematics (Springer, Berlin, 1983) 317-340.
18. R.W. Ritchie, Classes of predictably computable functions, Trans. A.M.S. 106 (1963).
19. H.E. Rose. Subrecursion: Functions and Hierarchies, Oxford Logic Guides (Oxford University Press, Oxford, UK, 1984).
20. R.M. Smullyan, Theory of Formal Systems, Annals of Mathematics Studies, Vol. 47 (Princeton University Press, Princeton, NJ, 1961).
21. C. Wrathall, Complete sets and the polynomial-time hierarchy, Theoret. Comput. Sci. 3 (1977) 23-33.
22. C. Wrathall, Rudimentary predicates and relative computation, SIAM J. Comput. 7 (1978) 194-209.