Skip to main content
Avi Wigderson
Personal
Short Bio
CV
Contact
Interviews & More
Works
Book: Math and Computation
Publications
Talks
Surveys
Efficient Universe
Post-Docs
Students
CSDM
Seminars
Conferences & videos
Optimization, Complexity and Invariant Theory
Avi60
Lens of Computation on the Sciences
Pseudorandomness
You are here
Home
»
Avi Wigderson
»
Publications
A Search Problem Related to Branch-and-Bound Procedures
Submitted by
smcneil
on Mon, 2012-01-16 00:00
Author:
R. Karp
M. Saks
A. Wigderson
Publication:
Proceedings of the 27th FOCS, pp. 19-28, October, 1986.
Hide
Files
File:
Proceedings version (pdf)
Proceedings version (ps)
bibTeX
‹ A Physical interpretation of graph connectivity and its algorithmic applications
up
A Strong Direct Product Theorem for Corruption and the Multiparty NOF Communication Complexity of Set Disjointness ›