SCOPUS 정보 검색 플랫폼

Volumn 33, Issue 3, 1999, Pages 259-269

On existentially first-order definable languages and their relation to NP

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIALS; SET THEORY; TURING MACHINES;

LEAF LANGUAGES; POLYNOMIAL TIME TURING MACHINE;

COMPUTATIONAL LINGUISTICS;

EID: 0033294921 PISSN: 09883754 EISSN: None Source Type: Journal
DOI: 10.1051/ita:1999116 Document Type: Article

Times cited : (17)

References (12)

1
- 0026910450
- Counting classes: Thresholds, parity, mods, and fewness
- R. Beigel and J. Gill, Counting classes: Thresholds, parity, mods, and fewness. Theoret. Comput. Sci. 103 (1992) 3-23.
- (1992) Theoret. Comput. Sci. , vol.103 , pp. 3-23
- Beigel, R.¹ Gill, J.²

2
- 0029635469
- On the acceptance power of regular languages
- B. Borchert, On the acceptance power of regular languages. Theoret. Comput. Sci. 148 (1995) 207-225.
- (1995) Theoret. Comput. Sci. , vol.148 , pp. 207-225
- Borchert, B.¹

3
- 38249007839
- A uniform approach to define complexity classes
- D.P. Bovet, P. Crescenzi and R. Silvestri, A uniform approach to define complexity classes. Theoret. Comput. Sci. 104 (1992) 263-283.
- (1992) Theoret. Comput. Sci. , vol.104 , pp. 263-283
- Bovet, D.P.¹ Crescenzi, P.² Silvestri, R.³

4
- 0000758387
- Lindström quantifiers and leaf language definability
- H.-J. Burtschick and H. Vollmer, Lindström Quantifiers and Leaf Language Definability. Internat. J. Found. Comput. Sci. 9 (1998) 277-294.
- (1998) Internat. J. Found. Comput. Sci. , vol.9 , pp. 277-294
- Burtschick, H.-J.¹ Vollmer, H.²

5
- 0024142223
- The boolean hierarchy I: Structural properties
- J.-Y. Cai, T. Gundermann, J. Hartmanis, L.A. Hemachandra, V. Sewelson, K. Wagner and G. Wechsung, The Boolean Hierarchy I: Structural properties. SIAM J. Comput. 17 (1988) 1232-1252.
- (1988) SIAM J. Comput. , vol.17 , pp. 1232-1252
- Cai, J.-Y.¹ Gundermann, T.² Hartmanis, J.³ Hemachandra, L.A.⁴ Sewelson, V.⁵ Wagner, K.⁶ Wechsung, G.⁷

6
- 0029327997
- On unique satisfiability and the threshold behaviour of randomized reductions
- R. Chang, J. Kadin and P. Rohatgi, On unique satisfiability and the threshold behaviour of randomized reductions. J. Comput. System Sci. 50 (1995) 359-373.
- (1995) J. Comput. System Sci. , vol.50 , pp. 359-373
- Chang, R.¹ Kadin, J.² Rohatgi, P.³

8
- 0004209273
- MIT Press, Cambridge, MA
- R. McNaughton and S. Papert, Counter-Free Automata, MIT Press, Cambridge, MA (1971).
- (1971) Counter-free Automata
- McNaughton, R.¹ Papert, S.²

9
- 0031536422
- Polynomial closure and unambiguous product
- J.-E. Pin and P. Weil, Polynomial closure and unambiguous product. Theory Comput. Systems 30 (1997) 383-422.
- (1997) Theory Comput. Systems , vol.30 , pp. 383-422
- Pin, J.-E.¹ Weil, P.²

10
- 0003556750
- Birkhäuser, Boston
- H. Straubing, Finite Automata, Formal Logic, and Circuit Complexity, Birkhäuser, Boston (1994).
- (1994) Finite Automata, Formal Logic, and Circuit Complexity
- Straubing, H.¹

11
- 0020246633
- Classifying regular events in symbolic logic
- W. Thomas, Classifying regular events in symbolic logic. J. Comput. System Sci. 25 (1982) 360-376.
- (1982) J. Comput. System Sci. , vol.25 , pp. 360-376
- Thomas, W.¹

12
- 0026239342
- PP is as hard as the polynomial-time hierarchy
- S. Toda, PP is as hard as the Polynomial-Time Hierarchy. SIAM J. Comput. 20 (1991) 865-877.
- (1991) SIAM J. Comput. , vol.20 , pp. 865-877
- Toda, S.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.