A restricted shift completeness problem
نویسندگان
چکیده
منابع مشابه
The Quantum Completeness Problem
Quantum mechanics (QM) is complete in a precise sense. It cannot be supplemented by more informative descriptions of physical systems given certain reasonable assumptions; this is what the no-hidden-variables proofs show. Theorems of Kochen-Specker-type (KS theorems) crucially employ an assumption of context-independence of the observables considered while those of Bell-type theorems use an ass...
متن کاملThe NP-completeness of the Restricted Stable Paths Problem with Three Aggregating Functions
Interdomain routing on the internet is performed using route preference policies specifiedindependently and arbitrarily by each autonomous system (AS) in the network. These policiesare used in the border gateway protocol (BGP) by each AS when selecting next-hop choices forroutes to each destination. Conflicts between policies used by different ASs can lead to routinginstabilitie...
متن کاملThe Restricted Burnside Problem
In 1902 William Burnside [5] wrote 'A still undecided point in the theory of discontinuous groups is whether the order of a group may be not finite, while the order of every operation it contains is finite'. In modern terminology the most general form of the problem is 'can a finitely generated group be infinite while every element in the group has finite order?'. This question was answered in ...
متن کاملNP-Completeness of Reallocation Problems with Restricted Block Volume
A reallocation problem is defined as determining whether blocks can be moved from their current boxes to their destination boxes in the number of moves less than or equal to a given positive integer. This problem is defined simply and has many practical applications. We previously proved the following results: The reallocation problem such that the block volume is restricted to one volume unit ...
متن کاملOn a restricted cross-intersection problem
Suppose A and B are families of subsets of an n-element set and L is a set of s numbers. We say that the pair (A,B) is L-cross-intersecting if |A∩B| ∈ L for every A ∈A and B ∈ B. Among such pairs (A,B) we write PL(n) for the maximum possible value of |A||B|. In this paper we find an exact bound for PL(n) when n is sufficiently large, improving earlier work of Sgall. We also determine P{2}(n) an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Analysis
سال: 2012
ISSN: 0022-1236
DOI: 10.1016/j.jfa.2012.06.017