2-D Tucker is PPA complete Page 1 2-D Tucker is PPA complete Preliminary version —
Comments appreciated. James Aisenberg∗ Dept. of Mathematics Univ. of California, San …

2-D Tucker is PPA complete - ScienceDirect Skip to main contentSkip to article Elsevier logo
Journals & Books Search RegisterSign in View PDF Download full issue View Open …

We display an application of the notions of kernelization and data reduction from
parameterized complexity to proof complexity: Specifically, we show that the existence of …

We study a new class of NP search problems, those which can be proved total using
standard combinatorial reasoning based on approximate counting. Our model for this kind of …

We study a new class of NP search problems, those which can be proved total using
standard combinatorial reasoning based on approximate counting. Our model for this kind of …

Graph homomorphism is a notion almost as simple, notationally and conceptually, as graph
coloring, but one that gives a rich mathematical structure, allowing for new fruitful …

A family of sets is called star‐shaped if all the members of the family have a point in
common. The main aim of this paper is to provide a negative answer to the following …

Proofs in propositional proof systems are often compositional: if P, Q, R are propositions
such that P|= Q and Q|= R, π1 is a propositional proof for P|= Q and π2 is a propositional …

Graph homomorphism is a notion almost as simple, notationally and conceptually, as graph
coloring, but one that gives a rich mathematical structure, allowing for new fruitful …

UNIVERSITY OF CALIFORNIA, SAN DIEGO The proof and search complexity of three
combinatorial principles A dissertation submitted i Page 1 UNIVERSITY OF CALIFORNIA, SAN …