#### Filter Results:

- Full text PDF available (12)

#### Publication Year

2012

2017

- This year (0)
- Last 5 years (14)
- Last 10 years (19)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Robert Robere
- 2012

The linear programming problem is usually solved through the use of one of two algorithms: either simplex, or an algorithm in the family of interior point methods. In this article two representative… (More)

A potential problem in computer networks is the existence of loops, which are cyclical paths through the network’s switches that can cause some packets to never leave the network. We present a… (More)

- Robert Robere, Toniann Pitassi, Benjamin Rossman, Stephen A. Cook
- 2016 IEEE 57th Annual Symposium on Foundations of…
- 2016

Monotone span programs are a linear-algebraic model of computation which were introduced by Karchmer and Wigderson in 1993 [1]. They are known to be equivalent to linear secret sharing schemes, and… (More)

- Yuval Filmus, Toniann Pitassi, Robert Robere, Stephen A. Cook
- 2013 IEEE 54th Annual Symposium on Foundations of…
- 2013

An approximate computation of a Boolean function by a circuit or switching network is a computation in which the function is computed correctly on the majority of the inputs (rather than on all… (More)

- Noah Fleming, Denis Pankratov, Toniann Pitassi, Robert Robere
- Electronic Colloquium on Computational Complexity
- 2017

The random k-SAT model is the most important and well-studied distribution over k-SAT instances. It is closely connected to statistical physics; it is used as a testbench for satisfiablity… (More)

- Toniann Pitassi, Robert Robere
- STOC
- 2016

We prove size lower bounds of 2Î©(n) for an explicit function in monotone NP in the following models of computation: monotone formulas, monotone switching networks, monotone span programs, and… (More)

- Toniann Pitassi, Robert Robere
- STOC
- 2017

We characterize the size of monotone span programs computing certain “structured” boolean functions by the Nullstellensatz degree of a related unsatisfiable Boolean formula. This yields the first… (More)

- Robert Robere, Tarek Richard Besold
- Australasian Conference on Artificial…
- 2012

After an introduction to Heuristic-Driven Theory Projection (HDTP) as framework for computational analogy-making, and a compact primer on parametrized complexity theory, we provide a complexity… (More)

In this supplementary material, we provide proofs of the complexity-theoretic statements appearing in our paper. In order to prove intractability results for the input-output mappings associated with… (More)

- D. Rachmildha Tri, Man Lê, +19 authors W. Wong
- 2014

Bounded Arithmetic and Formalizing Probabilistic Proofs Dai Tri Man Lê Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2014 The first theme of this thesis… (More)