Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Satoru Kuroda
2010 – today
- 2012
[c1]
2000 – 2009
- 2007
[j3]Satoru Kuroda: Generalized quantifier and a bounded arithmetic theory for LOGCFL. Arch. Math. Log. 46(5-6): 489-516 (2007)- 2004
[j2]Satoru Kuroda: Recursion Schemata for Slowly Growing Depth Circuit Classes. Computational Complexity 13(1-2): 69-89 (2004)- 2001
[j1]Satoru Kuroda: An Independence Result on Weak Second Order Bounded Arithmetic. Math. Log. Q. 47(2): 183-186 (2001)
1990 – 1999
- 1999
[i1]Satoru Kuroda: Weak length induction and slow growing depth boolean circuits. CoRR cs.LO/9907022 (1999)
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-09-10 15:49 CEST by the dblp team



