Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Reducibility among combinatorial problems (1972)

From MaRDI portal
Publication:5075296
Jump to:navigation, search

MaRDI QIDQ5075296FDOQ5075296


Authors:


Publication date: 12 May 2022





Recommendations

  • Reducibility among combinatorial problems
  • Reducibility among combinatorial problems
  • scientific article; zbMATH DE number 3858462
  • A brief history of NP-completeness, 1954--2012
  • scientific article; zbMATH DE number 2226428


Mathematics Subject Classification ID

History of computer science (68-03)



Cited In (1)

  • Barendregt's problem \#26 and combinatory strong reduction





This page was built for publication: Reducibility among combinatorial problems (1972)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075296)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5075296&oldid=19568323"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 12:06. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki