Easiness Amplification and Uniform Circuit Lower Bounds

We present new consequences of the assumption that time-bounded algorithms can be "compressed" with non-uniform circuits. Our main contribution is an "easiness amplification" lemma for circuits. One instantiation of the lemma says: if n^{1+e}-time, tilde{O}(n)-space computations have n^{1+o(1)} size (non-uniform) circuits for some e > 0, then every problem solvable in polynomial time and tilde{O}(n) space has n^{1+o(1)} size (non-uniform) circuits as well. This amplification has several consequences: * An easy problem without small LOGSPACE-uniform circuits. For all e > 0, we give a natural decision problem, General Circuit n^e-Composition, that is solvable in about n^{1+e} time, but we prove that polynomial-time and logarithmic-space preprocessing cannot produce n^{1+o(1)}-size circuits for the problem. This shows that there are problems solvable in n^{1+e} time which are not in LOGSPACE-uniform n^{1+o(1)} size, the first result of its kind. We show that our lower bound is non-relativizing, by exhibiting an oracle relative to which the result is false. * Problems without low-depth LOGSPACE-uniform circuits. For all e > 0, 1 < d < 2, and e < d we give another natural circuit composition problem computable in tilde{O}(n^{1+e}) time, or in O((log n)^d) space (though not necessarily simultaneously) that we prove does not have SPACE[(log n)^e]-uniform circuits of tilde{O}(n) size and O((log n)^e) depth. We also show SAT does not have circuits of tilde{O}(n) size and log^{2-o(1)}(n) depth that can be constructed in log^{2-o(1)}(n) space. * A strong circuit complexity amplification. For every e > 0, we give a natural circuit composition problem and show that if it has tilde{O}(n)-size circuits (uniform or not), then every problem solvable in 2^{O(n)} time and 2^{O(sqrt{n log n})} space (simultaneously) has 2^{O(sqrt{n log n})}-size circuits (uniform or not). We also show the same consequence holds assuming SAT has tilde{O}(n)-size circuits. As a corollary, if n^{1.1} time computations (or O(n) nondeterministic time computations) have tilde{O}(n)-size circuits, then all problems in exponential time and subexponential space (such as quantified Boolean formulas) have significantly subexponential-size circuits. This is a new connection between the relative circuit complexities of easy and hard problems

On the (Non) NP-Hardness of Computing Circuit Complexity

The Minimum Circuit Size Problem (MCSP) is: given the truth table of a Boolean function f and a size parameter k, is the circuit complexity of f at most k? This is the definitive problem of circuit synthesis, and it has been studied since the 1950s. Unlike many problems of its kind, MCSP is not known to be NP-hard, yet an efficient algorithm for this problem also seems very unlikely: for example, MCSP in P would imply there are no pseudorandom functions. Although most NP-complete problems are complete under strong "local" reduction notions such as poly-logarithmic time projections, we show that MCSP is provably not NP-hard under O(n^(1/2-epsilon))-time projections, for every epsilon > 0. We prove that the NP-hardness of MCSP under (logtime-uniform) AC0 reductions would imply extremely strong lower bounds: NP notsubset P/poly and E notsubset i.o.-SIZE(2^(delta * n)) for some delta > 0 (hence P = BPP also follows). We show that even the NP-hardness of MCSP under general polynomial-time reductions would separate complexity classes: EXP != NP cap P/poly, which implies EXP != ZPP. These results help explain why it has been so difficult to prove that MCSP is NP-hard. We also consider the nondeterministic generalization of MCSP: the Nondeterministic Minimum Circuit Size Problem (NMCSP), where one wishes to compute the nondeterministic circuit complexity of a given function. We prove that the Sigma_2 P-hardness of NMCSP, even under arbitrary polynomial-time reductions, would imply EXP notsubset P/poly

Secondary ion mass spectrometry and x-ray absorption near-edge structure spectroscopy of isotopically anomalous organic matter from CR1 chondrites GRO 95577

We located interstellar organics from a CR1 chondrite with NanoSIMS and analyzed FIB-extracted sections with XANES. D-rich material appears not associated with a functional group, whereas 15N-rich matter shows some affinity to nitrile functionality

Rotation of Late-Type Stars in Praesepe with K2

We have Fourier analyzed 941 K2 light curves of likely members of Praesepe, measuring periods for 86% and increasing the number of rotation periods (P) by nearly a factor of four. The distribution of P vs. (V-K), a mass proxy, has three different regimes: (V-K)<1.3, where the rotation rate rapidly slows as mass decreases; 1.3<(V-K)<4.5, where the rotation rate slows more gradually as mass decreases; and (V-K)>4.5, where the rotation rate rapidly increases as mass decreases. In this last regime, there is a bimodal distribution of periods, with few between $\sim$2 and $\sim$10 days. We interpret this to mean that once M stars start to slow down, they do so rapidly. The K2 period-color distribution in Praesepe ($\sim$790 Myr) is much different than in the Pleiades ($\sim$125 Myr) for late F, G, K, and early-M stars; the overall distribution moves to longer periods, and is better described by 2 line segments. For mid-M stars, the relationship has similarly broad scatter, and is steeper in Praesepe. The diversity of lightcurves and of periodogram types is similar in the two clusters; about a quarter of the periodic stars in both clusters have multiple significant periods. Multi-periodic stars dominate among the higher masses, starting at a bluer color in Praesepe ((V-K)$\sim$1.5) than in the Pleiades ((V-K)$\sim$2.6). In Praesepe, there are relatively more light curves that have two widely separated periods, $\Delta P >$6 days. Some of these could be examples of M star binaries where one star has spun down but the other has not.Comment: Accepted by Ap

Correlated analyses of D- and 15N-rich carbon grains from CR2 chondrite EET 92042

Extract from introduction: Insoluble organic matter (IOM) and matrix from primitive carbonaceous chondrites carry isotope enrichments (?D?20000', ?15N?3200�) that are comparable to those in interplanetary dust particles [1, this work]. Hence, primitive organics that formed in the protosolar cloud (PSC) – or maybe in the cold outer regions of the protoplanetary disk – survived accretion and planetary processing on the asteroids, the parent bodies of the chondrites

Correlated Microscale Isotope and Scanning Transmission X-Ray Analyses of Isotopically Anomalous Organic Matter from the CR2 Chondrite EET 92042

We discuss correlated examinations of organic matter from the CR2 chondrite EET 92042, using SIMS, STXM and other methods. We found a large, isotopically highly anomalous region of probable presolar origin that is C- and 13C-poor and 15N-rich

Integrated orbital servicing study for low-cost payload programs. Volume 2: Technical and cost analysis

Orbital maintenance concepts were examined in an effort to determine a cost effective orbital maintenance system compatible with the space transportation system. An on-orbit servicer maintenance system is recommended as the most cost effective system. A pivoting arm on-orbit servicer was selected and a preliminary design was prepared. It is indicated that orbital maintenance does not have any significant impact on the space transportation system

Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton Theorems

A frontier open problem in circuit complexity is to prove P^{NP} is not in SIZE[n^k] for all k; this is a necessary intermediate step towards NP is not in P_{/poly}. Previously, for several classes containing P^{NP}, including NP^{NP}, ZPP^{NP}, and S_2 P, such lower bounds have been proved via Karp-Lipton-style Theorems: to prove C is not in SIZE[n^k] for all k, we show that C subset P_{/poly} implies a "collapse" D = C for some larger class D, where we already know D is not in SIZE[n^k] for all k. It seems obvious that one could take a different approach to prove circuit lower bounds for P^{NP} that does not require proving any Karp-Lipton-style theorems along the way. We show this intuition is wrong: (weak) Karp-Lipton-style theorems for P^{NP} are equivalent to fixed-polynomial size circuit lower bounds for P^{NP}. That is, P^{NP} is not in SIZE[n^k] for all k if and only if (NP subset P_{/poly} implies PH subset i.o.- P^{NP}_{/n}). Next, we present new consequences of the assumption NP subset P_{/poly}, towards proving similar results for NP circuit lower bounds. We show that under the assumption, fixed-polynomial circuit lower bounds for NP, nondeterministic polynomial-time derandomizations, and various fixed-polynomial time simulations of NP are all equivalent. Applying this equivalence, we show that circuit lower bounds for NP imply better Karp-Lipton collapses. That is, if NP is not in SIZE[n^k] for all k, then for all C in {Parity-P, PP, PSPACE, EXP}, C subset P_{/poly} implies C subset i.o.-NP_{/n^epsilon} for all epsilon > 0. Note that unconditionally, the collapses are only to MA and not NP. We also explore consequences of circuit lower bounds for a sparse language in NP. Among other results, we show if a polynomially-sparse NP language does not have n^{1+epsilon}-size circuits, then MA subset i.o.-NP_{/O(log n)}, MA subset i.o.-P^{NP[O(log n)]}, and NEXP is not in SIZE[2^{o(m)}]. Finally, we observe connections between these results and the "hardness magnification" phenomena described in recent works