Information and ComputationVolume 121, Issue 1, 15 August 1995, Pages 123-134Regular ArticleCompleteness of Path-Problems via Logical ReductionsAuthor links open overlay panelStewart I.A.Show moreShareCitehttps://doi.org/10.1006/inco.1995.1127Get rights and contentUnder an Elsevier user licenseopen archiveAbstractWe show that some well-known path-problems remain complete for the respective complexity class via quantifier-free projections (these are extremely restricted logical reductions).Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1995 Academic Press. All rights reserved.
