Computation Models and Function Algebras

Computation Models and Function Algebras

Cached

Download Links

Other Repositories/Bibliography

DBLP

by P. Clote

Citations:

31 - 2 self

BibTeX

@MISC{Clote_computationmodels,
    author = {P. Clote},
    title = {Computation Models and Function Algebras},
    year = {}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

214	An unsolvable problem of elementary number theory - Church - 1936
184	Bounded-width polynomial-size branching programs recognize exactly those languages in NC 1 - Barrington - 1989
168	The complexity of finite functions - Boppana, Sipser - 1992
158	A new recursion-theoretic characterization of the poly-time functions - Bellantoni, Cook - 1992
106	Log depth circuits for division and related problems - Beame, Cook, et al. - 1984
100	Constant depth reducibility - Chandra, Stockmeyer, et al. - 1984
88	Sigma 1 formulae on finite structures - Ajtai
78	On Relating Time and Space to Size and Depth - Borodin - 1977
55	The Boolean formula value problem is in ALOGTIME - Buss - 1987
44	Arithmetization: A New Method in Structural Complexity Theory - Babai, Fortnow - 1991
43	Predicative Recursion and Computational Complexity - Bellantoni - 1992
22	On Spectra - Bennett - 1962
21	Predicative recursion and the polytime hierarchy - Bellantoni - 1994
20	On polynomial Size Frege Proofs of Certain Combinatorial Principles - Clote - 1993
18	Arithmetizing uniform NC - Allen - 1989
17	The polynomial hierarchy and intuitionistic bounded arithmetic, Structure in Complexity Theory - Buss - 1986
16	Algorithms for boolean formula evaluation and tree contraction - Buss - 1998
13	Function-algebraic characterizations of log and polylog parallel time," Computational Complexity 4 - Bloch - 1994
10	Bounded Arithmetic, volume 3 - Buss - 1986
9	On uniformity in NC - Barrington, Immerman, et al. - 1990
9	The Graph of Multiplication is Equivalent to Counting - Buss - 1992
9	PSPACE survives three-bit bottlenecks - Cai, Furst - 1988
7	A Safe Recursion Scheme for Exponential time - Clote - 1996
5	Sharply Bounded Alternation within P - Bloch, Goldsmith - 1992
5	A first order theory for the parallel complexity class NC - Clote - 1989
4	ALOGTIME and a conjecture of S.A - Clote - 1992
4	Parallel computable higher type functionals - Clote, Ignjatovic, et al. - 1993
4	Exponential time and bounded arithmetic - Clote, Takeuti - 1986
3	A computer description and a hierarchy of initial Grzegorczyk classes - Bel'tyukov - 1982
3	A note on the relation between polynomial time functionals and Constable's class K - Clote - 1996
2	Zum Hilbertschen Aufbau der reelen Zahlen - Ackermann - 1928
1	Primitive recursive word-functions of one variable - Asser - 1987
1	A time-space hierarchy between P and PSPACE - Clote - 1992
1	Nondeterministic stack register machines - Clote - 1997