Graphical Representations of Adolescents’ Psychophysiological Reactivity to Social Stressor Tasks: Reliability and Validity of the Chernoff Face Approach and Person-Centered Profiles for Clinical Use Andres De Los Reyes, Amelia Aldao, Noor Qasmieh, Emily J. Dunn, Melanie F. Lipton, Catharina Hartman, Eric A. Youngstrom, Lea R. Dougherty, and Matthew D. Lerner Online First Publication, July 18, ...

In this letter, we revisit the orbit problem, which was studied in [1,2,3]. In [3], Kannan and Lipton proved that this problem is decidable in polynomial time. In this paper, we study the approximate orbit problem, and show that this problem is decidable except for one case.

Karp and Lipton introduced advice-taking Turing machines to capture nonuniform complexity classes. We study this concept for automata-like models and compare it to other nonuniform models studied in connection with formal languages in the literature. Based on this we obtain complete separations of the classes of the Chomsky hierarchy relative to advices.

We relate the fixed argument pairing inversion problems (FAPI) and the discrete logarithm problem on an elliptic curve. This is done using the reduction from the DLP to the Diffie-Hellman problem developed by Boneh, Lipton, Maurer and Wolf. This approach fails when only one of the FAPI problems can be solved. In this case we use Cheon’s algorithm to get a reduction.

We show how the yardstick construction of Stockmeyer, also developed as counter bootstrapping by Lipton, can be adapted and extended to obtain new lower bounds for the coverability problem for two prominent classes of systems based on Petri nets: Ackermann-hardness for unordered data Petri nets, and Tower-hardness for pushdown vector addition systems.

William Cowper’s ‘fearless’ ‘confession’ is situated, in The Task (1784), as an introduction to the free operations of the fancy that make up the poem’s influential ‘brown study’ episode. Having ‘a soul that does not always think’ serves, in the passage that follows, not as an inhibition so much as an opportunity for the poet’s mind to do much more than think. The ‘ludicrous and wild’ conjuring...

Multiparty communication complexity was first defined by Chandra, Furst, and Lipton [6] and used to obtain lower bounds on branching programs. Since then it has been used to get additional lower bounds and tradeoffs for branching programs [1, 3], lower bounds on problems in data structures [3], time-space tradeoffs for restricted Turing machines [1], and unconditional pseudorandom generators fo...

Karp and Lipton introduced advice-taking Turing machines to capture nonuniform complexity classes. We study this concept for automata-like models and compare it to other nonuniform models studied in connection with formal languages in the literature. Based on this we obtain complete separations of the classes of the Chomsky hierarchy relative to advices.

Hartmanis used Kolmogorov complexity to provide an alternate proof of the classical result of Baker, Gill, and Solovay that there is an oracle relative to which P is not NP. We refine the technique to strengthen the result, constructing an oracle relative to which a conjecture of Lipton is false.