Results 271 to 280 of about 13,736,700 (344)
Effective Behaviour of Critical-Contrast PDEs: Micro-Resonances, Frequency Conversion, and Time Dispersive Properties. II. [PDF]
Commun Math PhysCherednichenko K +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
INFORMS journal on computing, 2020
The simple pattern minimality problem (SPMP) represents a central problem in the logical analysis of data and association rules mining, and it finds applications in several fields as logic synthesi...
M. Boccia, A. Sforza, C. Sterle
semanticscholar +1 more source
The simple pattern minimality problem (SPMP) represents a central problem in the logical analysis of data and association rules mining, and it finds applications in several fields as logic synthesi...
M. Boccia, A. Sforza, C. Sterle
semanticscholar +1 more source
Minimal covering problem and PLA minimization
International Journal of Computer & Information Sciences, 1985Solving the minimal covering problem by an implicit enumeration method is discussed. The implicit enumeration method in this paper is a modification of the Quine-McCluskey method tailored to computer processing and also its extension, utilizing some new properties of the minimal covering problem for speedup.
Young, Ming Huei, Muroga, Saburo
openaire +1 more source
, 2018
These notes record the lectures for the CIME Summer Course taught by the first author in Cetraro during the week of June 19-23, 2017. The notes contain the proofs of several results on the classification of stable solutions to some nonlinear elliptic ...
X. Cabré, Giorgio Poggesi
semanticscholar +1 more source
These notes record the lectures for the CIME Summer Course taught by the first author in Cetraro during the week of June 19-23, 2017. The notes contain the proofs of several results on the classification of stable solutions to some nonlinear elliptic ...
X. Cabré, Giorgio Poggesi
semanticscholar +1 more source
Proceedings of the thirty-second annual ACM symposium on Theory of computing, 2000
We study the complexity of the following circuit minimization problem: given the truth table of a Boolean function f and a parameter s, decide whether f can be realized by a Boolean circuit of size at most s. We argue why this problem is unlikely to be in P (or even in P/poly) by giving a number of surprising consequences of such an assumption. We also
Valentine Kabanets, Jin-Yi Cai
openaire +1 more source
We study the complexity of the following circuit minimization problem: given the truth table of a Boolean function f and a parameter s, decide whether f can be realized by a Boolean circuit of size at most s. We argue why this problem is unlikely to be in P (or even in P/poly) by giving a number of surprising consequences of such an assumption. We also
Valentine Kabanets, Jin-Yi Cai
openaire +1 more source
Time‐minimizing transportation problems
Naval Research Logistics Quarterly, 1969AbstractA method is given for finding those solutions of a transportation problem which minimize the total time necessary for transporting goods from the suppliers to the consumers. Several extensions of the model are presented.
openaire +1 more source