HIGHLIGHTS
- who: Duu0161an Knop from the Department of Theoretical Computer Science, Faculty of Information Technology, Czech Technical University in Prague, Prague, Czech Republic Hamburg University of Technology, Institute for Algorithms and Complexity, Hamburg, Germany have published the paper: High-multiplicity N-fold IP via configuration LP, in the Journal: (JOURNAL)
- what: In Sect 3 the authors show new bounds which do not depend exponentially on t. To overcome this, the authors develop new tools to deal with configurable cycles. The authors describe how to find an optimal basic solution of the dual of_(ConfLP). The authors . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.