Infinitely-Often Autoreducible Sets
Abstract
Index Terms
- Infinitely-Often Autoreducible Sets
Recommendations
Weak Mitoticity of Bounded Disjunctive and Conjunctive Truth-Table Autoreducible Sets
Computing and CombinatoricsAbstractGlaßer et al. (SIAMJCOMP 2008 and TCS 2009 (The two papers have slightly different sets of authors)) proved existence of two sparse sets A and B in EXP, where A is 3-tt (truth-table) polynomial-time autoreducible but not weakly polynomial-time ...
Splitting NP-complete sets infinitely
AbstractGlaßer et al. (SIAMJCOMP 2009 and TCS 2009) proved that NP-complete languages are polynomial-time mitotic for the many-one reduction, meaning that each NP-complete language L can be split into two NP-complete languages L ∩ S and L ∩ S ‾, where S ...
Highlights- Every NP-complete (NPC) set can be partitioned into infinitely many NPC subsets.
- Every NPC set can be partitioned into an effectively presentable infinite set of NPC subsets.
- Every NPC set can be partitioned into infinitely many ...
Sparse Selfreducible Sets and Nonuniform Lower Bounds
It is well-known that the class of sets that can be computed by polynomial size circuits is equal to the class of sets that are polynomial time reducible to a sparse set. It is widely believed, but unfortunately up to now unproven, that there are sets ...
Comments
Information & Contributors
Information
Published In
Publisher
Society for Industrial and Applied Mathematics
United States
Publication History
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in