Sciweavers

10 search results - page 2 / 2
» Last cases of Dejean's conjecture
Sort
View
DLT
2007
13 years 6 months ago
Two Element Unavoidable Sets of Partial Words
d Abstract) F. Blanchet-Sadri1 , N.C. Brownstein2 , and Justin Palumbo3 1 Department of Computer Science, University of North Carolina, P.O. Box 26170, Greensboro, NC 27402–6170,...
Francine Blanchet-Sadri, N. C. Brownstein, Justin ...
ACS
2007
13 years 5 months ago
Components of the Fundamental Category II
In this article we carry on the study of the fundamental category (Goubault and Raussen, 2002; Goubault, 2003) of a partially ordered topological space (Nachbin, 1965; Johnstone, 1...
Eric Goubault, Emmanuel Haucourt
SAC
2003
ACM
13 years 10 months ago
An Initial Investigation of Test Driven Development in Industry
Test Driven Development (TDD) is a software development practice in which unit test cases are incrementally written prior to code implementation. In our research, we ran a set of ...
Boby George, Laurie A. Williams
WDAG
2009
Springer
166views Algorithms» more  WDAG 2009»
13 years 11 months ago
New Bounds for the Controller Problem
The (M, W)-controller, originally studied by Afek, Awerbuch, Plotkin, and Saks, is a basic ted tool that provides an abstraction for managing the consumption of a global resource ...
Yuval Emek, Amos Korman
ECCC
2008
168views more  ECCC 2008»
13 years 4 months ago
Algebrization: A New Barrier in Complexity Theory
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
Scott Aaronson, Avi Wigderson