Nonconstructive tools for proving polynomial-time decidability 论文

1988Journal of the ACM引用 236
DOIPDF
Formal Methods in VerificationComplexity and Algorithms in GraphsAdvanced Graph Theory Research
Advanced Graph Theory ResearchFormal Methods in VerificationComplexity and Algorithms in Graphs
相关技术:Complexity and Algorithms in GraphsFormal Methods in Verification
关系图谱

Nonconstructive tools for proving polynomial-time decidability · 作者

M

Michael A. Langston

M

Michael R. Fellows