In this thesis we study the worst-case complexity ofconstraint satisfaction problems and some of its variants. We use methods from universal algebra: in particular, algebras of total functions and partial functions that are respectively known as clones and strong partial clones. The constraint satisfactionproblem parameterized by a set of relations ? (CSP(?)) is the following problem: given a set of variables restricted by a set of constraints based on the relations ?, is there an assignment to thevariables that satisfies all constraints? We refer to the set ? as aconstraint language. The inverse CSPproblem over ? (Inv-CSP(?)) asks the opposite: given a relation R, does there exist a CSP(?) instance with R as its set of models? When ? is a Boolean language, then we use the term SAT(?) instead of CSP(?) and Inv-SAT(?) instead of Inv-CSP(?). Fine-grained complexity is an approach in which we zoom inside a complexity class and classify theproblems in it based on their worst-case time complexities. We start by investigating the fine-grained complexity of NP-complete CSP(?) problems. An NP-complete CSP(?) problem is said to be easier than an NP-complete CSP(?) problem if the worst-case time complexity of CSP(?) is not higher thanthe worst-case time complexity of CSP(?). We first analyze the NP-complete SAT problems that are easier than monotone 1-in-3-SAT (which can be represented by SAT(R) for a certain relation R), and find out that there exists a continuum of such problems. For this, we use the connection between constraint languages and strong partial clones and exploit the fact that CSP(?) is easier than CSP(?) when the strong partial clone corresponding to ? contains the strong partial clone of ?. An NP-complete CSP(?) problem is said to be the easiest with respect to a variable domain D if it is easier than any other NP-complete CSP(?) problem of that domain. We show that for every finite domain there exists an easiest NP-complete problem for the ultraconservative CSP(?) problems. An ultraconservative CSP(?) is a special class of CSP problems where the constraint language containsall unary relations. We additionally show that no NP-complete CSP(?) problem can be solved insub-exponential time (i.e. in2^o(n) time where n is the number of variables) given that theexponentialtime hypothesisis true. Moving to classical complexity, we show that for any Boolean constraint language ?, Inv-SAT(?) is either in P or it is coNP-complete. This is a generalization of an earlier dichotomy result, which was only known to be true for ultraconservative constraint languages. We show that Inv-SAT(?) is coNP-complete if and only if the clone corresponding to ? contains essentially unary functions only. For arbitrary finite domains our results are not conclusive, but we manage to prove that theinversek-coloring problem is coNP-complete for each k>2. We exploit weak bases to prove many of theseresults. A weak base of a clone C is a constraint language that corresponds to the largest strong partia clone that contains C. It is known that for many decision problems X(?) that are parameterized bya constraint language ?(such as Inv-SAT), there are strong connections between the complexity of X(?) and weak bases. This fact can be exploited to achieve general complexity results. The Boolean domain is well-suited for this approach since we have a fairly good understanding of Boolean weak bases. In the final result of this thesis, we investigate the relationships between the weak bases in the Boolean domain based on their strong partial clones and completely classify them according to the setinclusion. To avoid a tedious case analysis, we introduce a technique that allows us to discard a largenumber of cases from further investigation.

Biman Roy's Of Moon and Washing Machine is a lovely collection of poems fusing nature, psychological insights, and the delightful flavoring of his East Indian heritage. Some are straightforward and others more surreal, but all bring to mind an interesting and curious mind that views the world with precision and, at times, a touch of humor. An engaging read!

Each dreamlike lyric in Biman Roy's Navigating the Quartz Forest is charmingly paired with a small handwritten note hastily jotted down on blue-lined notebook paper-artifacts from his daughter's life outside the family home. "All through the evening, we keep talking nonessentials, / tiptoeing around secret tulips," he says. These notes, like scraps of overheard conversations removed from their natural habitats, become the crystalline seeds of new poems. Side-by-side with each other, the poems act as translator for these somewhat oracular messages from an unknown world of teenage gossip and pop culture references, fitting the pieces together like a shattered mirror and filling in the jagged-edged gaps with the poet's expansive imagination. In Navigating the Quartz Forest, Roy's whimsical poems become a sparkling tribute from a father to his beloved daughter.

Dinosaur Hour, as a collection is concerned with the violence in nature, but also how articulating violence done to or by nature provided a relief from the strongest doubts of life, presenting a fresh, 21st century ars poetica response to the Romantic view of landscape holding all truths. Poem after poem, Roy presents imagery of a brutal (or brutalized) landscape against which humans are silent, ambivalent, and torn. His pastoral violence emerges as the most apt articulation in the speaker's interactions with others and with his own memories, anxieties around the passage of time, and concerns about what happens after this life ends.

Miss Manhattan truly captures the richness of diversity and the simultaneity of life happening in New York. The text is rich, tumbling, and layered, yet never chaotic as the sensations of people, cars, birds, flowers, and all forms of city life cascading around the speaker's (and reader's) attention. This unique collection cleverly displays the inherent resonance of life in the city, in a beautiful, joyful, and sometimes riotous, but always with a sense of life and creative force, not destruction or entropy. These poems live in the individual body, even as they describe an external and collective experience.

Mlle Manhattan capture vraiment la richesse de la diversité et la simultanéité de la vie à New York. Le texte est riche, tumultueux et stratifié, mais jamais chaotique comme les sensations des gens, des voitures, des oiseaux, des fleurs et de toutes les formes de vie urbaine en cascade autour de l'attention de l'orateur (et du lecteur). Cette collection unique montre intelligemment la résonance inhérente à la vie dans la ville, dans une belle et joyeuse et parfois agitée, mais toujours avec un sens de la vie et de la force créatrice, pas de destruction ou d'entropie. Ces poèmes vivent dans le corps individuel, même s'ils décrivent une expérience externe et collective.  Biman Roy écrit de la poésie depuis trois décennies et a été largement publié. Ses écrits ont été nominés pour le prix Best of the Net et Pushcart. Biman Roy est l'auteur d'un recueil de poèmes en prose, Of Moon and Washing Machine, et de deux autres recueils de poésie, Dinosaur Hour et Navigating the Quartz Forest.

Señorita Manhattan realmente captura la riqueza de la diversidad y la simultaneidad de la vida que sucede en Nueva York. El texto es rico, tambaleante y estratificado, pero nunca caótico como las sensaciones de personas, automóviles, pájaros, flores y todas las formas de vida de la ciudad que caen en cascada alrededor de la atención del orador (y del lector). Esta colección única muestra inteligentemente la resonancia inherente de la vida en la ciudad, en un lugar hermoso, alegre y, a veces, desenfrenado, pero siempre con un sentido de vida y fuerza creativa, no destrucción o entropía. Estos poemas viven en el cuerpo individual, incluso cuando describen una experiencia externa y colectiva. Biman Roy ha estado escribiendo poesía durante las últimas tres décadas y ha sido ampliamente publicado. Su escritura ha sido nominada para el premio Best of the Net y Pushcart. Biman Roy es autor de un libro de poemas en prosa, Of Moon and Washing Machine, y otros dos chapbooks de poesía, Dinosaur Hour y Navigating the Quartz Forest.

This is the story of a senior IT employee who is retrenched. He goes from pillar to post to find a job. He applies from Interpol to Prison Services, from manufacturing to banking, from clerical to IT head. He is just clueless. He was unprepared when he was in job. The book will prepare those who are in IT job or any job that rely on disruptive technologies.

Fräulein Manhattan fängt den Reichtum der Vielfalt und die Gleichzeitigkeit des Lebens in New York ein. Der Text ist reichhaltig, vielschichtig und vielschichtig, aber nie chaotisch, da die Empfindungen von Menschen, Autos, Vögeln, Blumen und allen Formen des Stadtlebens die Aufmerksamkeit des Sprechers (und des Lesers) auf sich ziehen. Diese einzigartige Sammlung zeigt geschickt die inhärente Resonanz des Lebens in der Stadt, in einer schönen, fröhlichen und manchmal aufrührerischen Weise, aber immer mit einem Gefühl von Leben und kreativer Kraft. nicht Zerstörung oder Entropie. Diese Gedichte leben im individuellen Körper, auch wenn sie eine äußere und kollektive Erfahrung beschreiben.