Polynomial-Time Axioms of Choice and Polynomial-Time Cardinality

نویسندگان

چکیده

Abstract There is no single canonical polynomial-time version of the Axiom Choice (AC); several statements AC that are equivalent in Zermelo-Fraenkel (ZF) set theory already inequivalent from a constructive point view, and similarly complexity-theoretic view. In this paper we show many classical formulations AC, when restricted to polynomial time natural ways, standard hypotheses, including were interest Selman. This provides unified view these hope additional motivation for studying some lesser-known hypotheses appear here. Additionally, because forms formulated terms cardinals, develop cardinality. Nerode & Remmel ( Contemp. Math. 106, 1990 Springer Lec. Notes 1432, 1990) developed related theory, but unary sets. Downey (Math. Reviews MR1071525) suggested such over larger alphabets could have interesting connections more complexity questions, illustrate those The between cardinality, questions also allow us highlight Selman’s work. We beginning than an end, introducing new concepts raising ripe further research.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polynomial-time kernel reductions

Today, the computational complexity of equivalence problems such as the graph isomorphism problem and the Boolean formula equivalence problem remain only partially understood. One of the most important tools for determining the (relative) difficulty of a computational problem is the many-one reduction, which provides a way to encode an instance of one problem into an instance of another. In equ...

متن کامل

Polynomial-Time Multi-Selectivity

We introduce a generalization of Selman's P-selectivity that yields a more exible notion of selectivity, called (polynomial-time) multi-selectivity, in which the selector is allowed to operate on multiple input strings. Since our introduction of this class, it has been used [HJRW96] to prove the rst known (and optimal) lower bounds for generalized selectivity-like classes in terms of EL2, the s...

متن کامل

A Polynomial Time Approximation

In this paper we study the following problem: Given n strings s1; s2; : : : ; sn, each of length m, nd a substring ti of length L for each si, and a string s of length L, such that max n i=1 d(s; ti) is minimized, where d(;) is the Hamming distance. The problem was raised in 6] in an application of genetic drug target search and is a key open problem in many applications 7]. The authors of 6] s...

متن کامل

Criteria for Polynomial Time (

Research in cluster analysis has resulted in a large number of algorithms and similarity measurements for clustering scienti c data. Machine learning researchers have published a number of methods for conceptual clustering, in which observations are grouped into clusters which have \good" descriptions in some language. We investigate the general properties which similarity metrics, objective fu...

متن کامل

On average polynomial time

One important reason to consider average case complexity is whether all or at least some signi cant part of NP can be solved e ciently on average for all reasonable distributions Let PP comp be the class of problems which are solvable in average polynomial time for every polynomial time computable input distribution Following the framework of Levin the above question can now be formulated as Is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theory of computing systems

سال: 2023

ISSN: ['1432-4350', '1433-0490']

DOI: https://doi.org/10.1007/s00224-023-10118-y