-
Recent Posts
- Finite Function Generation March 17, 2023
- Reachability for 1-Conservative Petri Nets January 27, 2023
- Non-Liveness of Free Choice Petri Nets January 12, 2023
- Cyclic Ordering December 21, 2022
- Betweenness December 7, 2022
Recent Comments
Archives
- March 2023
- January 2023
- December 2022
- November 2022
- October 2022
- September 2022
- August 2022
- June 2022
- May 2022
- December 2021
- November 2021
- October 2021
- September 2021
- August 2021
- July 2021
- May 2021
- April 2021
- March 2021
- February 2021
- January 2021
- December 2020
- November 2020
- October 2020
- September 2020
- August 2020
- March 2020
- February 2020
- January 2020
- December 2019
- November 2019
- October 2019
- September 2019
- August 2019
- July 2019
- June 2019
- May 2019
- April 2019
- March 2019
- February 2019
- January 2019
- December 2018
- November 2018
- October 2018
- September 2018
- August 2018
- July 2018
- June 2018
- May 2018
- April 2018
- March 2018
- February 2018
- January 2018
- December 2017
- November 2017
- October 2017
- September 2017
- August 2017
- July 2017
- June 2017
- May 2017
- April 2017
- March 2017
- February 2017
- January 2017
- December 2016
- November 2016
- October 2016
- September 2016
- August 2016
- July 2016
- June 2016
- May 2016
- April 2016
- March 2016
- February 2016
- January 2016
- December 2015
- November 2015
- October 2015
- September 2015
- August 2015
- July 2015
- June 2015
- May 2015
- April 2015
- March 2015
- February 2015
- January 2015
- December 2014
- November 2014
- October 2014
- September 2014
- August 2014
- July 2014
- June 2014
Categories
- Algebra and Number Theory
- Appendix- Algebra and Number Theory
- Appendix- Automata and Language Theory
- Appendix- Games and Puzzles
- Appendix- Mathematical Programming
- Appendix- Network Design
- Appendix- Program Optimization
- Appendix- Sets and Partitions
- Appendix-Graph Theory
- Appendix-Logic
- Appendix: Miscellaneous
- Appendix: Sequencing and Scheduling
- Appendix: Storage and Retrieval
- Chapter 3 Exercises
- Core Problems
- Overview
- Problems not in appendix
- Uncategorized
Tag Archives: Difficulty 4
Protected: Register Sufficiency For Loops
Enter your password to view comments.
Posted in Appendix- Program Optimization
Tagged Arc Coloring, Difficulty 4, PO3, Register Sufficiency For Loops
Protected: Context-Sensitive Language Membership
Enter your password to view comments.
Posted in Appendix- Automata and Language Theory
Tagged AL20, Context-Sensitive Language Membership, Difficulty 4, Linear Bounded Automaton Acceptance, uncited reduction
Protected: Linear Space Acceptance
Enter your password to view comments.
Posted in Problems not in appendix
Tagged Difficulty 4, Linear Bounded Automaton Acceptance, Linear Space Acceptance, Not in Appendix, QBF
Protected: Integer Expression Membership
Enter your password to view comments.
Posted in Appendix- Algebra and Number Theory
Tagged AN18, Difficulty 4, Integer Expression membership, Subset Sum
Protected: Unification for Finitely Presented Algebras
Enter your password to view comments.
Posted in Appendix- Algebra and Number Theory
Tagged AN17, Difficulty 4, Satisfiability, Unification for Finitely Presented Algebras
Protected: Unification With Commutative Operators
Enter your password to view comments.
Posted in Appendix- Algebra and Number Theory
Tagged AN16, Difficulty 4, No G&J reference, One-In-Three 3SAT, uncited reduction, Unification With Commutative Operators
Protected: Comparative Vector Inequalites
Enter your password to view comments.
Posted in Appendix- Mathematical Programming
Tagged Comparative Containment, Comparative Vector Inequalities, Difficulty 4, MP13
Protected: Staff Scheduling
Enter your password to view comments.
Posted in Appendix: Sequencing and Scheduling
Tagged Difficulty 4, No G&J reference, SS20, Staff Scheduling, uncited reduction, X3C
Protected: Precedence Constrained Scheduling
Enter your password to view comments.
Posted in Appendix: Sequencing and Scheduling
Tagged Difficulty 4, Multiprocessor Scheduling, Precedence Constrained Scheduling, Single execution time scheduling with variable number of processors, SS8, SS9
Protected: Scheduling to Minimize Weighted Completion Time
Enter your password to view comments.
Posted in Appendix: Sequencing and Scheduling
Tagged Difficulty 4, Difficulty 6, Optimal Linear Arrangement, Sequencing to Minimize Weighted Completion Time, SS4