The material of the article is devoted to the most complicated and interesting problem — a problem of P = NP?. This research was presented to mathematical community in Hyderabad during International Congress of Mathematicians [1]. But there it was published in a very brief form, so this article is an attempt to give those, who are interested in the problem, my reasoning on the theme. It is not ...

In this paper we aim at an analog characterization of the classical P 6= NP conjecture of Structural Complexity. We consider functions over continuous real and complex valued variables. Subclasses of functions can be defined using Laplace transforms adapted to continuous-time computation, introducing analog classes DAnalog and NAnalog. We then show that if DAnalog 6= NAnalog then P 6= NP .

avo as a known methodology is used to identify fluid type and reservoir lithology in subsurface exploration. method discussed in this paper, consists of three stages, including: direct modeling, inverse modeling and cross plot interpretation. by direct modeling we can clarify lithology or fluid dependent attributes. analysis performed using both p-p and p-sv attributes. inverse modeling deals w...

In this paper we show the relation between the "surface (morphological) cases" and "deep cases" (participants), and the possible way to automate the creation of a syntactic dictionary provided with frames containing information about deep cases and their morphemic counterparts of particular lexical items (Czech verbs).

We prove that knots with braid index three in the 3-sphere satisfy the Property P conjecture.

We show how to extend the recent result of Adleman 1] to use biological experiments to directly solve any NP problem. We, then, show how to use this method to speedup a large class of important problems.

We investigate the relationship between computation and spacetime structure, focussing on the role of closed timelike curves (CTCs) in promoting computational speedup. We note first that CTC traversal can be interpreted in two distinct ways, depending on ones understanding of spacetime. Focussing on one interpretation leads us to develop a toy universe in which no CTC can be traversed more than...

These are the proceedings of the 13 th conference on Advances in Computer Games which was held in Tilburg in November 2011. The first eight conferences (1975-1996) dealt exclusively with Computer Chess, but after DEEP BLUE’s victory over Kasparov in May 1997, the scope was broadened to include other games as well. The conference name was changed from Advanced in Computer Chess (ACC) to Advances...

We study upper and lower bounds on the kernel size for the 3-hitting set problem on hypergraphs of degree at most 3, denoted 33-hs. We first show that, unless P=NP, 3-3-hs on 3-uniform hypergraphs does not have a kernel of size at most 35k/19 > 1.8421k. We then give a 4k − k kernel for 3-3-hs that is computable in time O(k). This result improves the upper bound of 4k on the kernel size for 33-h...