Searching for CITATIONS to document sorted by Number of Citations:
D.: Computers and Intractability: A Guide to the Theory of NP-Completness
(1979)
by M Garey, Johnson
W.H. Freeman and Company
Add To MetaCart
4942 citations found, showing 1 through 10.
Next 10 →
-
Logical foundations of object-oriented and frame-based languages
- Cited by 646 (46 self) – Show/Hide Context – Add To MetaCart
-
A New Method for Solving Hard Satisfiability Problems
- Cited by 563 (21 self) – Show/Hide Context – Add To MetaCart
-
Proof verification and hardness of approximation problems
- Cited by 510 (31 self) – Show/Hide Context – Add To MetaCart
-
Factor Graphs and the Sum-Product Algorithm
- Cited by 503 (30 self) – Show/Hide Context – Add To MetaCart
-
Where the really hard problems are
- Cited by 462 (1 self) – Show/Hide Context – Add To MetaCart
-
Adaptive Display Algorithm for Interactive Frame Rates During Visualization of Complex Virtual Environments
- Cited by 353 (10 self) – Show/Hide Context – Add To MetaCart
-
Constraint Query Languages
- Cited by 315 (34 self) – Show/Hide Context – Add To MetaCart
-
How bad is selfish routing
- Cited by 295 (19 self) – Show/Hide Context – Add To MetaCart
-
Selection of relevant features and examples in machine learning
- Cited by 265 (0 self) – Show/Hide Context – Add To MetaCart
-
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata
- Cited by 243 (14 self) – Show/Hide Context – Add To MetaCart
