✦ LIBER ✦

Hard Problems

✍ Scribed by Review by: Sturgis E. Leavitt

Book ID: 125765537
Publisher: JSTOR
Year: 1952
Weight: 172 KB
Volume: 18
Category: Article
ISSN: 0038-2868
DOI: 10.2307/3197128

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hard Knapsack Problems

✍ Vasek Chvátal 📂 Article 📅 1980 🏛 INFORMS 🌐 English ⚖ 234 KB

Hard problem

✍ Martin Baker 📂 Article 📅 2012 🏛 Reed Business 🌐 English ⚖ 339 KB

Short Cycles MakeW-hard Problems Hard: F

Short Cycles MakeW-hard Problems Hard: FPT

✍ Venkatesh Raman; Saket Saurabh 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 473 KB

Generating hard satisfiability problems

✍ Bart Selman; David G. Mitchell; Hector J. Levesque 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 975 KB

We report results from large-scale experiments in satisfiability testing. As has been observed by others, testing the satisfiability of random formulas often appears surprisingly easy. Here we show that by using the right distribution of instances, and appropriate parameter values, it is possible to

The hard problem

✍ Hugo Lagercrantz 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB

Approaching hard non-classical problems

✍ Paul B. Thistlewaite; Michael A. McRobbie 📂 Article 📅 1991 🏛 Springer Netherlands 🌐 English ⚖ 95 KB