The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, the optimal information rate of the graph-based access structures with 7 vertices and 9 or 10 edges is researched, as well as the construction methods of perfect secret sharing schemes with optimal information rate. There are 222 non-isomorphic connected graph-based access structures of this type, which have been studied one by one. The exact values of the optimal information rate of...
This paper presents E-convex linear programming problem from the theorems and expands the single E-convex programming into double. And also E-convex programming definition and some theorems are given, which enriched the field of bilevel linear programming.
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.