메뉴 건너뛰기




Volumn 84, Issue 1, 1997, Pages 119-138

Corrigendum to “Advice classes of parameterized tractability” [Ann. Pure Appl. Logic 84 (1) (1997) 119–138] (S0168007295000208) (10.1016/S0168-0072(95)00020-8));Advice classes of parameterized tractability

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0031555827     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apal.2018.02.001     Document Type: Erratum
Times cited : (108)

References (32)
  • 2
    • 0000697831 scopus 로고
    • Fixed-parameter tractability and completeness IV: On Completeness for W[P] and PSPACE analogues
    • [2] K. Abrahamson, R. Downey and M. Fellows, Fixed-parameter tractability and completeness IV: On Completeness for W[P] and PSPACE analogues, Ann. Pure Appl. Logic. 73 (1995) 235-276
    • (1995) Ann. Pure Appl. Logic. , vol.73 , pp. 235-276
    • Abrahamson, K.1    Downey, R.2    Fellows, M.3
  • 3
    • 0000849902 scopus 로고
    • Finite automata, bounded treewidth, and well-quasiordering
    • N. Robertson and P. Seymour, eds., American Mathematical Society, Providence, RI
    • [3] K. Abrahamson and M. Fellows, Finite automata, bounded treewidth, and well-quasiordering,in: (N. Robertson and P. Seymour, eds.,) Graph Structure Theory, Contemporary Mathematics, Vol. 147 (American Mathematical Society, Providence, RI, 1993) 539-564.
    • (1993) Graph Structure Theory, Contemporary Mathematics , vol.147 , pp. 539-564
    • Abrahamson, K.1    Fellows, M.2
  • 4
    • 0023952869 scopus 로고
    • On the complexity of covering vertices by faces in a planar graph
    • [4] D. Bienstock and C.L. Monma, On the complexity of covering vertices by faces in a planar graph, SIAM J. Comp. 17 (1988) 53-76.
    • (1988) SIAM J. Comp. , vol.17 , pp. 53-76
    • Bienstock, D.1    Monma, C.L.2
  • 5
    • 0010927528 scopus 로고
    • Linear time Minor Tests and Depth First Search
    • F. Dehne et al., eds., Proc. 1st Workshop on Algorithms and Data Structures, Springer, Berlin
    • [5] H.L. Bodlaender, Linear time Minor Tests and Depth First Search, in: F. Dehne et al., eds., Proc. 1st Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, Vol. 382 (Springer, Berlin, 1989) 577-590.
    • (1989) Lecture Notes in Computer Science , vol.382 , pp. 577-590
    • Bodlaender, H.L.1
  • 6
    • 0010927733 scopus 로고
    • On disjoint cycles
    • Dept. Computer Science, Utrecht University, Utrecht, The Netherlands
    • [6] H.L. Bodlaender, On disjoint cycles, Technical Report RUU-CS-90-29, Dept. Computer Science, Utrecht University, Utrecht, The Netherlands, 1990.
    • (1990) Technical Report RUU-CS-90-29
    • Bodlaender, H.L.1
  • 7
    • 85010120898 scopus 로고
    • Two strikes against perfect phylogeny
    • W. Kuich, ed., Proc. 19th Internat. Colloquium on Automata, Languages and Programming (ICALP'92), Springer, Berlin
    • [7] H.L. Bodlaender, M. R. Fellows and T. Warnow, Two strikes against perfect phylogeny, in: W. Kuich, ed., Proc. 19th Internat. Colloquium on Automata, Languages and Programming (ICALP'92), Lecture Notes in Computer Science, Vol. 623, (Springer, Berlin, 1992) 273-283.
    • (1992) Lecture Notes in Computer Science , vol.623 , pp. 273-283
    • Bodlaender, H.L.1    Fellows, M.R.2    Warnow, T.3
  • 8
    • 0027609791 scopus 로고
    • Nondeterminism within P,"
    • [8] J.F. Buss and J. Goldsmith, Nondeterminism within P," SIAM J. Comp. 22 (1993) 560-572.
    • (1993) SIAM J. Comp. , vol.22 , pp. 560-572
    • Buss, J.F.1    Goldsmith, J.2
  • 9
    • 85029598892 scopus 로고
    • On the amount of nondeterminism and the power of verifying
    • Proc. Mathematical Foundations of Computer Science (1993) to appear; Springer-Verlag, MFCS'93Springer, Berlin
    • [9] L. Cai and J. Chen, On the amount of nondeterminism and the power of verifying, in: Proc. Mathematical Foundations of Computer Science (1993) to appear; Lecture Notes in Computer Science, Springer-Verlag, Vol. 711 (MFCS'93)(Springer, Berlin, 1993) 311-320.
    • (1993) Lecture Notes in Computer Science , vol.711 , pp. 311-320
    • Cai, L.1    Chen, J.2
  • 12
    • 0000909256 scopus 로고
    • Fixed parameter tractability and completeness
    • [12] R.G. Downey and M.R. Fellows, Fixed parameter tractability and completeness, Congr. Numer., 87 (1992) 161-187.
    • (1992) Congr. Numer. , vol.87 , pp. 161-187
    • Downey, R.G.1    Fellows, M.R.2
  • 14
    • 0001800124 scopus 로고
    • Fixed parameter tractability and completeness III: Some structural aspects of the W-Hierarchy
    • K. Ambos-Spies, S. Homer and U. Schoning eds.
    • [14] R.G. Downey and M.R. Fellows, Fixed parameter tractability and completeness III: some structural aspects of the W-Hierarchy, in: K. Ambos-Spies, S. Homer and U. Schoning eds., Complexity Theory: Current Research (Cambridge University Press, Cambridge, 1993) 166-191.
    • (1993) Complexity Theory: Current Research , pp. 166-191
    • Downey, R.G.1    Fellows, M.R.2
  • 15
    • 0002721363 scopus 로고
    • Parameterized computational feasibility
    • P. Clote and J. Remmel, eds., Birkhauser, Boston
    • [15] R.G. Downey and M.F. Fellows, Parameterized computational feasibility, in: P. Clote and J. Remmel, eds., Feasible Mathematics II (Birkhauser, Boston, 1995) 219-244
    • (1995) Feasible Mathematics II , pp. 219-244
    • Downey, R.G.1    Fellows, M.F.2
  • 16
    • 0000134883 scopus 로고
    • Fixed parameter tractability and completeness I: Basic results
    • [16] R.G. Downey and M.R. Fellows, Fixed parameter tractability and completeness I: basic results, SIAM J. Comput. 24 (1995) 873-921.
    • (1995) SIAM J. Comput. , vol.24 , pp. 873-921
    • Downey, R.G.1    Fellows, M.R.2
  • 17
    • 0029290085 scopus 로고
    • Fixed parameter tractability and completeness II: On completeness for W[1]
    • [17] R. G. Downey and M. R. Fellows, Fixed parameter tractability and completeness II: on completeness for W[1], Theoretical Comput. Sci. 141 (1995) 109-131.
    • (1995) Theoretical Comput. Sci. , vol.141 , pp. 109-131
    • Downey, R.G.1    Fellows, M.R.2
  • 19
    • 85010136218 scopus 로고
    • DNA physical mapping: Three ways difficult
    • Proc. First European Symp. on Algorithms, T. Lengaver ed., Springer-Verlag
    • [19] M.R. Fellows, M.T. Hallett and H. T. Wareham, DNA physical mapping: three ways difficult, Proc. First European Symp. on Algorithms, 1993, T. Lengaver ed., Lecture Notes in Computer Science, Springer-Verlag, Vol 726, 157-168
    • (1993) Lecture Notes in Computer Science , vol.726 , pp. 157-168
    • Fellows, M.R.1    Hallett, M.T.2    Wareham, H.T.3
  • 20
    • 84935052734 scopus 로고
    • Fixed-parameter complexity and cryptography
    • Proc. Tenth Internat. Conf. on Algebraic Algorithms and Error-Correcting Codes (AAECC 10), Springer, Berlin
    • [20] M.R. Fellows and N. Koblitz, Fixed-parameter complexity and cryptography, in: Proc. Tenth Internat. Conf. on Algebraic Algorithms and Error-Correcting Codes (AAECC 10), Lecture Notes in Computer Science (Springer, Berlin, 1993).
    • (1993) Lecture Notes in Computer Science
    • Fellows, M.R.1    Koblitz, N.2
  • 22
    • 0024768844 scopus 로고
    • An analogue of the Myhill-Nerode theorem and its use in computing finite basis characterizations
    • [22] M.R. Fellows and M.A. Langston, An analogue of the Myhill-Nerode theorem and its use in computing finite basis characterizations, in: Proc. Symp. Foundations of Comp. Sci. (FOCS) (1989), 520-525.
    • (1989) Proc. Symp. Foundations of Comp. Sci. (FOCS) , pp. 520-525
    • Fellows, M.R.1    Langston, M.A.2
  • 25
    • 84976851566 scopus 로고
    • Word problems solvable in logspace
    • [25] R. Lipton and Y. Zalcstein, Word problems solvable in logspace. J. Assoc. Comput. Mach. 24 (1977) 522-526.
    • (1977) J. Assoc. Comput. Mach. , vol.24 , pp. 522-526
    • Lipton, R.1    Zalcstein, Y.2
  • 26
    • 0010806455 scopus 로고
    • On the complexity of the subgraph problem
    • [26] J. Nesetril and S. Poljak, On the complexity of the subgraph problem, Comm. Math. Univ. Carol. 26 (1985) 415-419.
    • (1985) Comm. Math. Univ. Carol. , vol.26 , pp. 415-419
    • Nesetril, J.1    Poljak, S.2
  • 27
    • 0024935858 scopus 로고
    • Finitary substructure languages, with application to the theory of NP-completeness
    • [27] K. Regan, Finitary substructure languages, with application to the theory of NP-completeness, Proc. 4th Structure in Complexity Theory Conf., 1989, 87-96.
    • (1989) Proc. 4th Structure in Complexity Theory Conf. , pp. 87-96
    • Regan, K.1
  • 28
    • 0042975237 scopus 로고    scopus 로고
    • Graph minors XIII. The disjoint paths problem
    • to appear
    • [28] N. Robertson and P.D. Seymour, Graph minors XIII. The disjoint paths problem, J. Comb. Theory B. to appear.
    • J. Comb. Theory B
    • Robertson, N.1    Seymour, P.D.2


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