Everything about Truth-table reduction

🧭 Start here: a 6-step reading path

1. Read the overview: Truth-table reductionA 5-minute orientation
2. Pick up a classic book: Cartesian meditationsThe most-reprinted book on the subject
3. Read the landmark paper: PP Is Closed under Truth-Table ReductionsCited 22 times
4. Go sideways: Reduction (computability theory)A closely related topic
5. Go sideways: Many-one reductionA closely related topic

🏆 Landmark papers (most cited)

• PP Is Closed under Truth-Table Reductions

  Lance Fortnow, Nick Reingold · 1996 · Information and Computation · 22 citations

📚 Books worth reading

• Cartesian meditationsEdmund Husserl, Dorion Cairns · 1960
• PsychologyMichael Maher · 1890
• PsychologyMaher, Michael · 1900
• Winsor McCayWinsor McCay · 2003
• Principles of logicGeorge Hayward Joyce · 1908
• The Conspirators HierarchyJohn Coleman · 1992
• An elementary handbook of logicToohey, John Joseph · 1918
• Digital systems testing and testable designMiron Abramovici · 1990

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• Reduction (computability theory) In computability theory, many reducibility relations (also called reductions, reducibilities, and notions of reducibility) are studied. They are motivated…
• Many-one reduction In computability theory and computational complexity theory, a many-one reduction (also called mapping reduction) is a reduction that converts instances…
• Post's theorem In computability theory, Post's theorem, named after Emil Post, describes the connection between the arithmetical hierarchy and the Turing degrees. The…
• Turing reduction In computability theory, a Turing reduction from a decision problem A to a decision problem B is an oracle machine that decides problem A given an oracle…
• Cook–Levin theorem In computational complexity theory, the Cook–Levin theorem, also known as Cook's theorem, states that the Boolean satisfiability problem is NP-complete…
• Computation in the limit In computability theory, a function is called limit computable if it is the limit of a uniformly computable sequence of functions. The terms computable…
• Jaimovich–Rebelo preferences Jaimovich–Rebelo preferences refer to a utility function that allows to parameterize the strength of short-run wealth effects on the labor supply, originally…
• K-trivial set In mathematics, a set of natural numbers is called a K-trivial set if its initial segments viewed as binary strings are easy to describe: the prefix-free…