MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Sophie Laplante" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 16 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Lower bounds using Kolmogorov complexity  
  • by Sophie Laplante — 2006 — In Proceedings of CiE’06
  • …Abstract. In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functions, which gives the complexity of finding a bit where inputs differ, for pairs of inputs that map to different function …
  • Cited by 1 (0 self) – Add To MetaCart
  • Lower bounds for randomized and quantum query complexity using Kolmogorov arguments  
  • by Sophie Laplante — 2004 — in Proc. of the 19th IEEE Conference on Computational Complexity
  • …Abstract. We prove a very general lower bound technique for quantum and randomized query complexity that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolmogorov complexity to query complexity. Our technique generalizes the weighted and unweighted methods of Ambainis…
  • Cited by 25 (5 self) – Add To MetaCart
  • Indistinguishability  
  • by Sophie Laplante, John Rogers — 1996
  • …Two strings are distinguished by a program if the program always outputs one of f0; 1; ?g, and it outputs 1 on one of the strings and 0 on the other. Two strings are k-indistinguishable if no program of length at most k can distinguish them. In this paper, we introduce the formal definitions for ind…
  • Add To MetaCart
  • A Kolmogorov Complexity proof of Håstad's switching lemma - An Exposition  
  • by An Exposition, Sophie Laplante — 1994
  • …We present here a proof of Hastad's switching lemma. The switching lemma has important applications in the proof of lower bounds in circuit complexity as well as other areas of complexity theory. The proof presented here is based on the one presented in [5], expressed in terms of Kolmogorov complexi…
  • Add To MetaCart
  • Circuit Lower Bounds à la Kolmogorov  
  • by Lance Fortnow, Sophie Laplante, Sophie Laplante
  • …In a recent paper, Razborov [Raz93] gave a new combinatorial proof of Hastad's switching lemma [Has89], eliminating the probabilistic argument altogether. In this paper we adapt his proof and propose a Kolmogorov complexity-style switching lemma, from which we derive the probabilistic switching lemm…
  • Cited by 5 (2 self) – Add To MetaCart
  • Nearly Optimal Language Compression using Extractors  
  • by Lance Fortnow, Sophie Laplante — 1998 — In Proceedings of the 15th Symposium on Theoretical Aspects of Computer Science
  • …. We show two sets of results applying the theory of extractors to resource-bounded Kolmogorov complexity: Most strings in easy sets have nearly optimal polynomial-time CD complexity. This extends work of Sipser [Sip83] and Buhrman and Fortnow [BF97]. We use extractors to extract the randomne…
  • Cited by 3 (3 self) – Add To MetaCart
  • A Note on Adaptiveness and Advice in Coherence  
  • by Lance Fortnow, Sophie Laplante — 1994
  • …Partially supported by NSF grant CCR 92--53582 y Partially supported by an NSERC doctoral fellowship 2 Deterministic examiners suffice First we show that if a function is nonadaptively weakly coherent, then we can assume without loss of generality that the examiner is deterministic. Lemma 2.1 G…
  • Cited by 2 (2 self) – Add To MetaCart
  • Stronger Separations for Random-Self-Reducibility, Rounds, and Advice  
  • by Laszlo Babai, Sophie Laplante — 1999 — In IEEE Conference on Computational Complexity
  • …A function f is self-reducible if it can be computed given an oracle for f . In a random-self-reduction the queries must be made in such a way that the distribution of the ith query is independent of the input that gave rise to it. Randomself -reductions have many applications, including countless c…
  • Cited by 2 (2 self) – Add To MetaCart
  • Kolmogorov Techniques in Computational Complexity Theory  
  • by Sophie Laplante, Joan Feigenbaum, Lance Fortnow — 1997
  • …. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vii CHAPTER 1. INTRODUCTION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.1 iHow Hard is this Problem?j . . . . . . . . . . . . . . . . . . . . 1 1.1.1 An introduction to computational complexity . . . . . . . 3 …
  • Cited by 1 (1 self) – Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB