R.M. Karp, "Reducibility among combinatorial problems, " Complexity of Computer Computations, R.E. Miller, J.W. Thatcher, Eds., Plenum Press, 1972. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
An Approximation Algorithm for the Disjoint Paths Problem in.. - Kleinberg (2005) (62 citations) (Correct)
No context found.
R.M. Karp, "Reducibility among combinatorial problems, " Complexity of Computer Computations, R.E. Miller, J.W. Thatcher, Eds., Plenum Press, 1972.
Geometric and Dynamic Sensing: Observation of Pose and Motion.. - Jia (1997) (Correct)
No context found.
Richard M. Karp. Reducibility among combinatorial problems. In Raymond E. Miller and James W. Thatcher, editors, Complexity of Computer Computations. Plenum Press, New York, 1972.
Disjoint Paths in Densely Embedded Graphs - Jon Kleinberg Eva (Correct)
No context found.
R.M. Karp, "Reducibility among combinatorial problems," Complexity of Computer Computations, R.E. Miller, J.W. Thatcher, Eds., New York: Plenum Press, 1972. pp. 85--103.
Geometry of Semide - Nite Max-Cut Relaxations (Correct)
No context found.
R. M. KARP. Reducibility among combinatorial problems. In R. E. Miller and J.W. Thatcher, editors, Complexity of Computer Computation, pages 85-103. Plenum Press, New York, 1972.
Unknown - Strengthenedsemidefiniteprogramming.. (Correct)
No context found.
R. M. KARP. Reducibility among combinatorial problems. In R. E. Miller and J.W. Thatcher, editors, Complexity of Computer Computation, pages 85--103. Plenum Press, New York, 1972.
Unknown - (Correct)
No context found.
R. M. Karp. Reducibility Among Combinatorial Problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85--103. Plenum Press, 1972. 122
Spelling-Error Tolerant, Order-Independent.. - Damerau-Levenshtein.. (Correct)
No context found.
Karp, R. (1972), Reducibility among combinatorial problems, in `Proc. Symposium on the Complexity of Computer Computations'.
for Vision-Based Navigation - Pablo Sala For (Correct)
No context found.
R. Karp. Reducibility among Combinatorial Problems. In Miller and Thatcher, editors, Complexity of Computer Computations, pages 85--103. Plenum Press, New York, NY, USA, 1972.
Journal of Machine Learning Research 7 (2006) 919--943.. - Pitfalls Remedies And (Correct)
No context found.
R. M. Karp. Reducibility among combinatorial problems. In Complexity of Computer Computations, pages 85--103. Plenum Press, New York, 1972.
Landmark Selection for Vision-Based Navigation - Pablo Sala Robert (Correct)
No context found.
R. Karp, "Reducibility among combinatorial problems", Complexity of Computer Computations, Plenum Press, New York 1972, pp. 85103.
Landmark Selection for Vision-Based Navigation - Pablo Sala Student (2006) (Correct)
No context found.
R. Karp, "Reducibility among combinatorial problems," in Complexity of Computer Computations, R. E. Miller and J. W. Thatcher, Eds. New York: Plenum, 1972, pp. 85--103.
Complexity of Constructing Solutions in the Core Based on.. - Conitzer, Sandholm (2006) (Correct)
No context found.
Karp, R., 1972. Reducibility among combinatorial problems. In: Miller, R. E., Thatcher, J. W. (Eds.), Complexity of Computer Computations. Plenum Press, NY, pp. 85--103.
Experimental Evaluation of the Greedy and - Random Algorithms For (Correct)
No context found.
R. M. Karp. Reducibility among combinatorial problems. Complexity of Computer Computatiolns, pages 85--103, 1972.
On the Parameterized Complexity - Of Exact Satisfiability (Correct)
No context found.
R. Karp. Reducibility among combinatorial problems. In R. Miller and J. Thatcher, editors, Complexity of Computer Communications, pages 85--103. Plenum Press, 1972.
Software Engineering within a Digital Business Ecosystem - Marcon, Corallo, De.. (2006) (Correct)
No context found.
Karp, R.M.: Reducibility among combinatorial problems. In Miller, R.E., Thatcher, J.W., eds.: Complexity of Computer Computations. Plenum Press (1972) 85--103
Int. J. of Computational Science and Engineering, Vol. 1.. - Max-Cut Problem Sera (Correct)
No context found.
R. M. Karp. Reducibility among combinatorial problems. In R. Miller and J. Thatcher, editors, Complexity of Computer Computations, pages 85--103. Plenum Press, 1972.
Greedy Algorithms for on-Line Set-Covering and Related.. - Ausiello, Giannakos.. (2006) (Correct)
No context found.
Karp, R. M. (1972), Reducibility among combinatorial problems, in R. E. Miller & J. W. Thatcher, eds, `Complexity of computer computations', Plenum Press, New York, pp. 85--103.
An Optimization Problem in Adaptive Virtual Environments - Sundararaj, Sanghi, Lange, .. (2005) (Correct)
No context found.
KARP, R. Compexity of Computer Computations. Miller, R.E. and Thatcher, J.W. (Eds.). Plenum Press, New York, 1972, ch. Reducibility among combinatorial problems, pp. 85--103.
Unknown - (1994) (Correct)
No context found.
Karp, R. M. #1972#. Reducibility among combinatorial problems. In Miller, R. E. and Thatcher, J. W., editors, Complexity of Computer Computations, pages 85#103. Plenum Press, New York, NY.
Parameterized Tractability of Edge-Disjoint Paths - On Directed Acyclic (Correct)
No context found.
R.M. Karp, "Reducibility among combinatorial problems," Complexity of Computer Computations , R.E. Miller, J.W. Thatcher, Eds., Plenum Press, New York (1972) 85-103.
Is SHA-1 conceptually sound? - Jutla, Patthak (2005) (Correct)
No context found.
R. M. Karp. Reducibility among combinatorial problems. Plenum Press, New York, 1972.
Identifying Conflicts in Overconstrained Temporal Problems - Mark Liffiton Michael (Correct)
No context found.
Richard M. Karp. Reducibility among combinatorial problems. In Complexity of Computer Computations, pages 85--103. Plenum Press, 1972.
Landmark Selection for Vision-Based Navigation - Sala, Sim, Shokoufandeh.. (Correct)
No context found.
R. Karp, "Reducibility among Combinatorial Problems," in Complexity of Computer Computations, Miller and Thatcher, Eds. New York, NY, USA: Plenum Press, 1972, pp. 85--103.
Maximum Exact Satisfiability: NP-completeness Proofs and.. - Madsen, Rossmanith (2004) (Correct)
No context found.
R. M. Karp. Reducibility among combinatorial problems. Complexity of Computer Computations, pages 85--103, 1972.
Focused Inference - Rosales, Jaakkola (Correct)
No context found.
R. M. Karp, Reducibility among combinatorial problems, In R. E. Miller and J. W. Thatcher, eds., Complexity of Computer Computations (1972), 85--104.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC