Abstract
We shall introduce a special mode of interactive computations of optimal solutions to optimization problems. A restricted version of such computations was used in [KPT] to show that T 2 i = S 2 i+1 implies ∑ i+2 p = П i+2 p . Here we shall reduce the question whether T 2 i = S 2 i to a question about interactive computations (in a more general sense) of some optimization problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
