The following pages link to Toniann Pitassi (Q202089):
Displaying 50 items.
- Zero-information protocols and unambiguity in Arthur-Merlin communication (Q343848) (← links)
- Toward a model for backtracking and dynamic programming (Q430838) (← links)
- Special issue in memory of Misha Alekhnovich. Foreword (Q430839) (← links)
- Regular resolution lower bounds for the weak pigeonhole principle (Q558246) (← links)
- Exponential lower bounds for the tree-like Hajós calculus (Q673010) (← links)
- Exponential lower bounds for the pigeonhole principle (Q687506) (← links)
- A feasibly constructive lower bound for resolution proofs (Q915457) (← links)
- Unsolvable systems of equations and proof complexity (Q1126839) (← links)
- The relative complexity of NP search problems (Q1273858) (← links)
- Good degree bounds on Nullstellensatz refutations of the induction principle (Q1276164) (← links)
- Improved depth lower bounds for small distance connectivity (Q1293359) (← links)
- Homogenization and the polynomial calculus (Q1430569) (← links)
- Non-automatizability of bounded-depth Frege proofs (Q1764155) (← links)
- An exponential separation between the parity principle and the pigeonhole principle (Q1923563) (← links)
- Semantics of nondeterministic asynchronous broadcast networks (Q2366562) (← links)
- A strong direct product theorem for corruption and the multiparty communication complexity of disjointness (Q2460032) (← links)
- The complexity of properly learning simple concept classes (Q2462500) (← links)
- Towards a complexity-theoretic understanding of restarts in SAT solvers (Q2661349) (← links)
- Minimum propositional proof length is NP-hard to linearly approximate (Q2732273) (← links)
- Stochastic Boolean satisfiability (Q2751046) (← links)
- (Q2754208) (← links)
- The efficiency of resolution and Davis-Putnam procedures (Q2784492) (← links)
- Upper and lower bounds on the power of advice (Q2816830) (← links)
- Fairness through awareness (Q2826058) (← links)
- Exponential lower bounds for \(\mathrm{AC}^0\)-Frege imply superpolynomial Frege lower bounds (Q2828228) (← links)
- Hardness amplification in proof complexity (Q2875135) (← links)
- Differential privacy under continual observation (Q2875198) (← links)
- Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures (Q2884578) (← links)
- Preserving Statistical Validity in Adaptive Data Analysis (Q2941495) (← links)
- The Hardness of Being Private (Q2943893) (← links)
- Formula Caching in DPLL (Q2947546) (← links)
- The reusable holdout: Preserving validity in adaptive data analysis (Q2961909) (← links)
- Rank bounds and integrality gaps for cutting planes procedures (Q3002766) (← links)
- (Q3002781) (← links)
- Separating deterministic from randomized multiparty communication complexity (Q3002822) (← links)
- Automatizability and Simple Stochastic Games (Q3012836) (← links)
- Exponential Lower Bounds for AC0-Frege Imply Superpolynomial Frege Lower Bounds (Q3012837) (← links)
- The PSPACE-Completeness of Black-White Pebbling (Q3068646) (← links)
- Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems (Q3167381) (← links)
- The complexity of analytic tableaux (Q3410672) (← links)
- Lower Bounds for Lovász–Schrijver Systems and Beyond Follow from Multiparty Communication Complexity (Q3507523) (← links)
- An exponential separation between regular and general resolution (Q3579185) (← links)
- Monotone Circuits for the Majority Function (Q3595404) (← links)
- Minimizing Disjunctive Normal Form Formulas and $AC^0$ Circuits Given a Truth Table (Q3614150) (← links)
- (Q3779734) (← links)
- Approximation and Small-Depth Frege Proofs (Q4027856) (← links)
- (Q4218098) (← links)
- (Q4218929) (← links)
- (Q4230340) (← links)
- (Q4234077) (← links)
