Results 181 to 190 of about 306,960 (218)
Some of the next articles are maybe not open access.
Mathematics of Operations Research, 1979
The partition value is a new approach to the value concept. It links together the asymptotic and the axiomatic approach. Using this approach we prove the existence of a continuous value on each of the following spaces: bv′NA, A, A * bv′NA, A * bv′NA * bv′NA and the space W spanned by those spaces and ASYMP.
Abraham Neyman, Yair Tauman
openaire +1 more source
The partition value is a new approach to the value concept. It links together the asymptotic and the axiomatic approach. Using this approach we prove the existence of a continuous value on each of the following spaces: bv′NA, A, A * bv′NA, A * bv′NA * bv′NA and the space W spanned by those spaces and ASYMP.
Abraham Neyman, Yair Tauman
openaire +1 more source
International Journal: Canada's Journal of Global Policy Analysis, 1998
The Island of Ireland was partitioned and placed under two new systems of government between 1920 and 1922. This was not the simple and straight-forward process of division to be seen in places like Czechoslovakia, but it has its instructive side. Independence for Slovakia was relatively easy to arrange because the population of the area came very ...
openaire +1 more source
The Island of Ireland was partitioned and placed under two new systems of government between 1920 and 1922. This was not the simple and straight-forward process of division to be seen in places like Czechoslovakia, but it has its instructive side. Independence for Slovakia was relatively easy to arrange because the population of the area came very ...
openaire +1 more source
SIAM Journal on Discrete Mathematics, 2003
Summary: List partitions generalize list colorings and list homomorphisms. (We argue that they may be called list ``semihomomorphisms.'') Each symmetric matrix \(M\) over \(0,1,*\) defines a list partition problem. Different choices of the matrix \(M\) lead to many well-known graph theoretic problems, often related to graph perfection, including the ...
Tomás Feder +3 more
openaire +2 more sources
Summary: List partitions generalize list colorings and list homomorphisms. (We argue that they may be called list ``semihomomorphisms.'') Each symmetric matrix \(M\) over \(0,1,*\) defines a list partition problem. Different choices of the matrix \(M\) lead to many well-known graph theoretic problems, often related to graph perfection, including the ...
Tomás Feder +3 more
openaire +2 more sources
Partitioned encryption and achieving simultaneity by partitioning
Information Processing Letters, 1987zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zvi Galil, Moti Yung
openaire +1 more source
Journal of Philosophical Logic, 1999
An approach to the partition semantics of conditional logic was given by \textit{B. Skyrms} [see: Pragmatics and empiricism (Yale Univ. Press, New Haven) (1984)]. In this paper the author investigates the role and the place of Skyrms' semantics in the development of this subject.
openaire +1 more source
An approach to the partition semantics of conditional logic was given by \textit{B. Skyrms} [see: Pragmatics and empiricism (Yale Univ. Press, New Haven) (1984)]. In this paper the author investigates the role and the place of Skyrms' semantics in the development of this subject.
openaire +1 more source
Order, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Algorithms for graph partitioning on the planted partition model
Random Structures and Algorithms, 1999Summary: The NP-hard graph bisection problem is to partition the nodes of an undirected graph into two equal-sized groups so as to minimize the number of edges that cross the partition. The more general graph \(\ell\)-partition problem is to partition the nodes of an undirected graph into \(\ell\) equal-size groups so as to minimize the total number of
Anne Condon, Richard M. Karp
openaire +2 more sources
Combinatorica, 1993
For even \(n\), let \(p(n)\) denote the number of partitions of \(n\) and \(G(n)\) denote the number of graphical partitions of \(n\). A partition \(\pi=(\lambda_1,\lambda_2,\dots,\lambda_m)\) is graphical if there exists a graph with degree sequence \(\pi\). The authors discuss progress and possible lines in enquiry on the questions of whether or not \
Paul Erdös, L. Bruce Richmond
openaire +1 more source
For even \(n\), let \(p(n)\) denote the number of partitions of \(n\) and \(G(n)\) denote the number of graphical partitions of \(n\). A partition \(\pi=(\lambda_1,\lambda_2,\dots,\lambda_m)\) is graphical if there exists a graph with degree sequence \(\pi\). The authors discuss progress and possible lines in enquiry on the questions of whether or not \
Paul Erdös, L. Bruce Richmond
openaire +1 more source
2010
The chapter is structured as follows: I. Interpretative categories I.1 Dividing without partitioning I.2 Applied forms of partitions I.3 The fragility of terminology II. The attractiveness of partition II.1 The interaction of statehood and nationhood II.2 Equality and inequality in partitioning processes II.3 Multiplying states or the attractiveness of
openaire +3 more sources
The chapter is structured as follows: I. Interpretative categories I.1 Dividing without partitioning I.2 Applied forms of partitions I.3 The fragility of terminology II. The attractiveness of partition II.1 The interaction of statehood and nationhood II.2 Equality and inequality in partitioning processes II.3 Multiplying states or the attractiveness of
openaire +3 more sources
Functional partitioning of transcriptional regulators by patterned charge blocks
Cell, 2023Heankel Lyons +2 more
exaly