The following pages link to (Q4230322):
Displaying 50 items.
- Distance graphs and the \(T\)-coloring problem (Q1297406) (← links)
- Extracting randomness: A survey and new constructions (Q1305929) (← links)
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
- Tight bound on Johnson's algorithm for maximum satisfiability (Q1307701) (← links)
- The complexity of the max word problem and the power of one-way interactive proof systems (Q1312183) (← links)
- The maximum clique problem (Q1318271) (← links)
- Some MAX SNP-hard results concerning unordered labeled trees (Q1318750) (← links)
- Maximum bounded \(H\)-matching is Max SNP-complete (Q1321820) (← links)
- Two results in negation-free logic (Q1324497) (← links)
- The hardness of approximation: Gap location (Q1332662) (← links)
- A short note on the approximability of the maximum leaves spanning tree problem (Q1336751) (← links)
- On the power of multi-prover interactive protocols (Q1341733) (← links)
- Theorems for a price: Tomorrow's semi-rigorous mathematical culture (Q1343655) (← links)
- The death of proof? Semi-rigorous mathematics? You've got to be kidding! (Q1343656) (← links)
- Probabilistically checkable proofs and their consequences for approximation algorithms (Q1344618) (← links)
- On the Steiner ratio in 3-space (Q1345879) (← links)
- Weighted fractional and integral \(k\)-matching in hypergraphs (Q1346702) (← links)
- On approximation algorithms for the minimum satisfiability problem (Q1351157) (← links)
- On an approximation measure founded on the links between optimization and polynomial approximation theory (Q1351453) (← links)
- Inferring a tree from walks (Q1351963) (← links)
- The hardness of approximate optima in lattices, codes, and systems of linear equations (Q1356888) (← links)
- On fixed-parameter tractability and approximability of NP optimization problems (Q1362338) (← links)
- Measure on \(P\): Strength of the notion (Q1362904) (← links)
- The complexity and approximability of finding maximum feasible subsystems of linear relations (Q1367542) (← links)
- MNP: A class of NP optimization problems (Q1368182) (← links)
- Randomized graph products, chromatic numbers, and the Lovász \(\vartheta\)-function (Q1375058) (← links)
- The complexity of minimum partial truth assignments and implication in negation-free formulae (Q1380416) (← links)
- Rounding algorithms for covering problems (Q1380937) (← links)
- Approximating the independence number via the \(\vartheta\)-function (Q1380939) (← links)
- On chromatic sums and distributed resource allocation (Q1383159) (← links)
- On the approximability of some Maximum Spanning Tree Problems (Q1391300) (← links)
- Approximate testing with error relative to input size. (Q1400577) (← links)
- On the approximability of the Steiner tree problem. (Q1401253) (← links)
- Alarm placement in systems with fault propagation (Q1575642) (← links)
- An improved approximation algorithm of MULTIWAY CUT. (Q1577011) (← links)
- Approximating minimum feedback vertex sets in hypergraphs (Q1583598) (← links)
- Clique is hard to approximate within \(n^{1-\epsilon}\) (Q1588908) (← links)
- A 2-approximation algorithm for the minimum weight edge dominating set problem (Q1602689) (← links)
- Which problems have strongly exponential complexity? (Q1604206) (← links)
- Annealed replication: A new heuristic for the maximum clique problem (Q1613385) (← links)
- The complexity of minimizing and learning OBDDs and FBDDs (Q1613429) (← links)
- Ramsey theory and integrality gap for the independent set problem (Q1667206) (← links)
- Minimization of ordered, symmetric half-products (Q1763481) (← links)
- Order consolidation for batch processing (Q1774533) (← links)
- The complexity of Boolean constraint satisfaction local search problems (Q1777392) (← links)
- On the complexity of finding emerging patterns (Q1781987) (← links)
- On the approximability of an interval scheduling problem (Q1806343) (← links)
- On the complexity of the approximation of nonplanarity parameters for cubic graphs (Q1827857) (← links)
- Derandomized graph products (Q1842777) (← links)
- The inapproximability of non-NP-hard optimization problems. (Q1853546) (← links)
