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.
Graph isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant gap between extant lower and upper bounds for planar graphs as well. We bridge the gap for this natural and important special case by presenting an upper bound that matches the known log-space hardness. In fact, we show the...
1. On 250-volt and 125-volt a-c circuits, arcing faults are unstable and will extinguish themselves within two cycles or less even when initiated by four number 8 copper wires on a bus with 4-inch spacing. On buses with less than 4-inch spacing, it would be expected that the arc would have more of a tendency to stabilize itself. 2. About half of the line-to-line arcing faults on the 500-volt circuit...
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.