Does Advice Help to Prove Propositional Tautologies?

One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable functions which have all propositional tautologies as their range. Motivated by provability consequences in bounded arithmetic, Cook and Krajíček [5] have recently started the investigation of proof systems which are computed by poly-time functions using advice. While this yields a more powerful model, it is also less directly applicable in practice. In this note we investigate the question whether the usage of advice in propositional proof systems can be simplified or even eliminated. While in principle, the advice can be very complex, we show that proof systems with logarithmic advice are also computable in poly-time with access to a sparse NP-oracle. In addition, we show that if advice is ”not very helpful” for proving tautologies, then there exists an optimal propositional proof system without advice. In our main result, we prove that advice can be transferred from the proof to the formula, leading to an easier computational model. We obtain this result by employing a recent technique by Buhrman and Hitchcock [4]

Nondeterministic Instance Complexity and Proof Systems with Advice

Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Krajíček [1] have recently introduced the notion of propositional proof systems with advice. In this paper we investigate the following question: Given a language L , do there exist polynomially bounded proof systems with advice for L ? Depending on the complexity of the underlying language L and the amount and type of the advice used by the proof system, we obtain different characterizations for this problem. In particular, we show that the above question is tightly linked with the question whether L has small nondeterministic instance complexity

Gravitational waves from quasi-spherical black holes

A quasi-spherical approximation scheme, intended to apply to coalescing black holes, allows the waveforms of gravitational radiation to be computed by integrating ordinary differential equations.Comment: 4 revtex pages, 2 eps figure

Formation of molecular oxygen in ultracold O + OH reaction

We discuss the formation of molecular oxygen in ultracold collisions between hydroxyl radicals and atomic oxygen. A time-independent quantum formalism based on hyperspherical coordinates is employed for the calculations. Elastic, inelastic and reactive cross sections as well as the vibrational and rotational populations of the product O2 molecules are reported. A J-shifting approximation is used to compute the rate coefficients. At temperatures T = 10 - 100 mK for which the OH molecules have been cooled and trapped experimentally, the elastic and reactive rate coefficients are of comparable magnitude, while at colder temperatures, T < 1 mK, the formation of molecular oxygen becomes the dominant pathway. The validity of a classical capture model to describe cold collisions of OH and O is also discussed. While very good agreement is found between classical and quantum results at T=0.3 K, at higher temperatures, the quantum calculations predict a larger rate coefficient than the classical model, in agreement with experimental data for the O + OH reaction. The zero-temperature limiting value of the rate coefficient is predicted to be about 6.10^{-12} cm^3 molecule^{-1} s^{-1}, a value comparable to that of barrierless alkali-metal atom - dimer systems and about a factor of five larger than that of the tunneling dominated F + H2 reaction.Comment: 9 pages, 8 figure

Verifying proofs in constant depth

In this paper we initiate the study of proof systems where verification of proofs proceeds by NC circuits. We investigate the question which languages admit proof systems in this very restricted model. Formulated alternatively, we ask which languages can be enumerated by NC functions. Our results show that the answer to this problem is not determined by the complexity of the language. On the one hand, we construct NC proof systems for a variety of languages ranging from regular to NP-complete. On the other hand, we show by combinatorial methods that even easy regular languages such as Exact-OR do not admit NC proof systems. We also present a general construction of proof systems for regular languages with strongly connected NFA's

A Tight Karp-Lipton Collapse Result in Bounded Arithmetic

Cook and Krajíček [9] have obtained the following Karp-Lipton result in bounded arithmetic: if the theory proves , then collapses to , and this collapse is provable in . Here we show the converse implication, thus answering an open question from [9]. We obtain this result by formalizing in a hard/easy argument of Buhrman, Chang, and Fortnow [3]. In addition, we continue the investigation of propositional proof systems using advice, initiated by Cook and Krajíček [9]. In particular, we obtain several optimal and even p-optimal proof systems using advice. We further show that these p-optimal systems are equivalent to natural extensions of Frege systems

The deduction theorem for strong propositional proof systems

This paper focuses on the deduction theorem for propositional logic. We define and investigate different deduction properties and show that the presence of these deduction properties for strong proof systems is powerful enough to characterize the existence of optimal and even polynomially bounded proof systems. We also exhibit a similar, but apparently weaker condition that implies the existence of complete disjoint NP-pairs. In particular, this yields a sufficient condition for the completeness of the canonical pair of Frege systems and provides a general framework for the search for complete NP-pairs

Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes.

In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise class C? For concrete languages L (such as TAUT or SAT) and concrete promise classes C (such as NP∩coNP, UP, BPP, disjoint NP-pairs etc.), these ques-tions have been intensively studied during the last years, and a number of characterizations have been obtained. Here we provide new character-izations for Q1 and Q2 that apply to almost all promise classes C and languages L, thus creating a unifying framework for the study of these practically relevant questions. While questions Q1 and Q2 are left open by our results, we show that they receive affirmative answers when a small amount on advice is avail-able in the underlying machine model. This continues a recent line of research on proof systems with advice started by Cook and Kraj́ıček [6]

Genome-wide co-expression analysis in multiple tissues

Expression quantitative trait loci (eQTLs) represent genetic control points of gene expression, and can be categorized as cis- and trans-acting, reflecting local and distant regulation of gene expression respectively. Although there is evidence of co-regulation within clusters of trans-eQTLs, the extent of co-expression patterns and their relationship with the genotypes at eQTLs are not fully understood. We have mapped thousands of cis- and trans-eQTLs in four tissues (fat, kidney, adrenal and left ventricle) in a large panel of rat recombinant inbred (RI) strains. Here we investigate the genome-wide correlation structure in expression levels of eQTL transcripts and underlying genotypes to elucidate the nature of co-regulation within cis- and trans-eQTL datasets. Across the four tissues, we consistently found statistically significant correlations of cis-regulated gene expression to be rare (&#60;0.9% of all pairs tested). Most (&#62;80%) of the observed significant correlations of cis-regulated gene expression are explained by correlation of the underlying genotypes. In comparison, co-expression of trans-regulated gene expression is more common, with significant correlation ranging from 2.9%-14.9% of all pairs of trans-eQTL transcripts. We observed a total of 81 trans-eQTL clusters (hot-spots), defined as consisting of &#62; or =10 eQTLs linked to a common region, with very high levels of correlation between trans-regulated transcripts (77.2-90.2%). Moreover, functional analysis of large trans-eQTL clusters (&#62; or =30 eQTLs) revealed significant functional enrichment among genes comprising 80% of the large clusters. The results of this genome-wide co-expression study show the effects of the eQTL genotypes on the observed patterns of correlation, and suggest that functional relatedness between genes underlying trans-eQTLs is reflected in the degree of co-expression observed in trans-eQTL clusters. Our results demonstrate the power of an integrative, systematic approach to the analysis of a large gene expression dataset to uncover underlying structure, and inform future eQTL studies

Program logics for homogeneous meta-programming.

A meta-program is a program that generates or manipulates another program; in homogeneous meta-programming, a program may generate new parts of, or manipulate, itself. Meta-programming has been used extensively since macros were introduced to Lisp, yet we have little idea how formally to reason about metaprograms. This paper provides the first program logics for homogeneous metaprogramming – using a variant of MiniMLe by Davies and Pfenning as underlying meta-programming language.We show the applicability of our approach by reasoning about example meta-programs from the literature. We also demonstrate that our logics are relatively complete in the sense of Cook, enable the inductive derivation of characteristic formulae, and exactly capture the observational properties induced by the operational semantics