Sciweavers

2354 search results - page 281 / 471
» A Common-Sense Theory of Time
Sort
View
ECCC
2006
145views more  ECCC 2006»
15 years 6 months ago
Constraint satisfaction: a personal perspective
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
Tomás Feder
COMBINATORICA
2007
129views more  COMBINATORICA 2007»
15 years 6 months ago
Birth control for giants
The standard Erd˝os-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n 2 rounds as one time unit, a phase tra...
Joel H. Spencer, Nicholas C. Wormald
IPL
2007
99views more  IPL 2007»
15 years 6 months ago
Substitutions into propositional tautologies
We prove that there is a polynomial time substitution (y1, . . . , yn) := g(x1, . . . , xk) with k << n such that whenever the substitution instance A(g(x1, . . . , xk)) of ...
Jan Krajícek
IPL
2007
105views more  IPL 2007»
15 years 6 months ago
A new algorithm for testing if a regular language is locally threshold testable
A new algorithm is presented for testing if a regular language is locally threshold testable. The new algorithm is slower than existing algorithms, but its correctness proof is sh...
Mikolaj Bojanczyk
BIOINFORMATICS
2005
152views more  BIOINFORMATICS 2005»
15 years 6 months ago
Intervention in context-sensitive probabilistic Boolean networks
Motivation: Intervention in a gene regulatory network is used to help it avoid undesirable states, such as those associated with a disease. Several types of intervention have been...
Ranadip Pal, Aniruddha Datta, Michael L. Bittner, ...