Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference22 articles.
1. Fixed Parameter Intractability, II;Abrahamson,1993
2. Fixed parameter intractability and completeness IV: On completeness forWPPSPACE;Abrahamson;Ann. Pure Appl. Logic,1995
3. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and intractability of approximation problems, Proceedings, 33th IEEE Symposium on Foundations of Computer Science, 1992, 14, 23
4. Learnability and the Vapnik–Chervonenkis dimension;Blummer;J. Assoc. Comput. Mach.,1989
5. H. L. Bodlaender, M. R. Fellows, M. T. Hallett, Beyond NP- completeness for problems of bounded width: Hardness for theW, Proc. 26th ACM Symposium on Theory of Computing, 1994, 449, 458
Cited by
58 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献