A. J. Wilkie, Applications of complexity theory to # 0 -definability problems in arithmetic, in Model Theory of Algebra and Arithmetic, Lecture Notes in Mathematics #834, Springer-Verlag, 1979, pp. 363--369. 5  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Lower Bounds For Uniform Constant Depth Circuits - Gore (1993) (Correct)
.... from (1) the desire to have a tool for talking about the structure of very small complexity classes such as Dspace(log n) and (2) an interest in generalizing the notion of rudimentary relations, which at that time was the object of a considerable amount of attention [Smu61, Wra78, Sal73, PD80, Wil79, PHW85] In [Jon75] Jones goes on to show that a number of problems are complete for various complexity classes under logbounded rudimentary reducibility. For a function S, he defines RUD S , the class of S(1) bounded rudimentary predicates. Informally, consider a class of predicates that ....
A. Wilkie. Applications of complexity theory to 6 0 -definability of problems in arithmetic. In Lecture Notes in Mathematics, volume 834, pages 363-- 369. Springer-Verlag, 1979.
The Graph of Multiplication is Equivalent to Counting - Buss (1991) (9 citations) (Correct)
No context found.
A. J. Wilkie, Applications of complexity theory to # 0 -definability problems in arithmetic, in Model Theory of Algebra and Arithmetic, Lecture Notes in Mathematics #834, Springer-Verlag, 1979, pp. 363--369. 5
Bounded Arithmetic, Proof Complexity and Two Papers of Parikh - Buss (2002) (Correct)
No context found.
A. J. Wilkie, Applications of complexity theory to # 0 -definability problems in arithmetic, in Model Theory of Algebra and Arithmetic, Lecture Notes in Mathematics #834, Springer-Verlag, 1979, pp. 363--369.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC