Torrent details for "Krajicek J. Proof Complexity Generators 2025" Log in to bookmark
Controls:
×
Report Torrent
Please select a reason for reporting this torrent:
Your report will be reviewed by our moderation team.
×
Report Information
Loading report information...
This torrent has been reported 0 times.
Report Summary:
| User | Reason | Date |
|---|
Failed to load report information.
×
Success
Your report has been submitted successfully.
Checked by:
Category:
Language:
None
Total Size:
8.4 MB
Info Hash:
9BED6293E4134D7F01A561ECFDB83AC5BCFC5AD9
Added By:
Added:
June 22, 2025, 2:27 p.m.
Stats:
|
(Last updated: June 22, 2025, 2:27 p.m.)
| File | Size |
|---|---|
| ['Krajicek J. Proof Complexity Generators 2025.pdf'] | 0 bytes |
NOTE
SOURCE: Krajicek J. Proof Complexity Generators 2025
-----------------------------------------------------------------------------------
COVER
-----------------------------------------------------------------------------------
MEDIAINFO
Textbook in PDF format The P vs. NP problem is one of the fundamental problems of mathematics. It asks whether propositional tautologies can be recognized by a polynomial-time algorithm. The problem would be solved in the negative if one could show that there are propositional tautologies that are very hard to prove, no matter how powerful the proof system you use. This is the foundational problem (the NP vs. coNP problem) of proof complexity, an area linking mathematical logic and computational complexity theory. Written by a leading expert in the field, this book presents a theory for constructing such hard tautologies. It introduces the theory step by step, starting with the historic background and a motivational problem in bounded arithmetic, before taking the reader on a tour of various vistas of the field. Finally, it formulates several research problems to highlight new avenues of research
×