Log in

Relevant bibliographies by topics / NP-complexity / Books

Books on the topic 'NP-complexity'

To see the other types of publications on this topic, follow the link: NP-complexity.

Author: Grafiati

Published: 30 May 2022

Last updated: 31 May 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 16 books for your research on the topic 'NP-complexity.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse books on a wide variety of disciplines and organise your bibliography correctly.

1

Gogan, J. Vincent. Slice functions and the method of approximations. Toronto, Ont: University of Toronto, Dept. of Computer Science, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Gogan, J. Vincent. Slice functions and the method of approximations. Ottawa: National Library of Canada, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Antoine, Lobstein, and Cohen Gerard, eds. Algorithmic complexityand communication problems. London: UCL Press, 1996.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Efficient checking of polynomials and proofs and the hardness of approximation problems. Berlin: Springer₋Verlag, 1995.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Barthelemy, Jean-Pierre. Algorithmic complexity and communication problems. London: UCL Press, 1996.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Zakrzewski, Marek. Wprowadzenie w teorię złożoności obliczeniowej: W kręgu zagadnienia P-NP. Wrocław: Wydawn. Politechniki Wrocławskiej, 1990.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

P Np And Npcompleteness The Basics Of Computational Complexity. Cambridge University Press, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Bogdanov, Andrej, and Luca Trevisan. Average-Case Complexity. Now Publishers Inc, 2006.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Percus, Allon, Gabriel Istrate, and Cristopher Moore, eds. Computational Complexity and Statistical Physics. Oxford University Press, 2005. http://dx.doi.org/10.1093/oso/9780195177374.001.0001.

Full text

Abstract:

Computer science and physics have been closely linked since the birth of modern computing. In recent years, an interdisciplinary area has blossomed at the junction of these fields, connecting insights from statistical physics with basic computational challenges. Researchers have successfully applied techniques from the study of phase transitions to analyze NP-complete problems such as satisfiability and graph coloring. This is leading to a new understanding of the structure of these problems, and of how algorithms perform on them. Computational Complexity and Statistical Physics will serve as a standard reference and pedagogical aid to statistical physics methods in computer science, with a particular focus on phase transitions in combinatorial problems. Addressed to a broad range of readers, the book includes substantial background material along with current research by leading computer scientists, mathematicians, and physicists. It will prepare students and researchers from all of these fields to contribute to this exciting area.

APA, Harvard, Vancouver, ISO, and other styles

10

Cohen, G., J.-P. Barthelmy, and A. Lobstein. Algorithmic Complexity and Telecommunication Problems. CRC, 1997.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

11

Fortnow, Lance. Golden Ticket: P, NP, and the Search for the Impossible. Princeton University Press, 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

12

Fortnow, Lance. Golden Ticket: P, Np, and the Search for the Impossible. Princeton University Press, 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

13

Fortnow, Lance. The Golden Ticket: P, NP, and the Search for the Impossible. Princeton University Press, 2017.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

14

Peterson, Tyler. Alignment across Tsimshianic. Edited by Jessica Coon, Diane Massam, and Lisa Demena Travis. Oxford University Press, 2017. http://dx.doi.org/10.1093/oxfordhb/9780198739371.013.41.

Full text

Abstract:

The Tsimshianic languages are entirely morphologically ergative in the agreement system. While there is a split in Tsimshianic, conditioned by both clause type and a person hierarchy, the other side of the split is not the expected nominative-accusative alignment. Rather, other logical groupings of semantic roles are found that are still ergative. This chapter presents a description of the agreement patterns across Tsimshianic, with the aim of explaining these expansions of ergativity, by undertaking a comparative analysis of the individual languages in the Tsimshianic family. This is analysis is extended to the connectives, which are complex, determiner-like morphemes that appear to be sensitive to the semantic role of the NP. This leads to four distinct alignments (nominative, ergative, neutral, and contrastive). An understanding of the alignments in the agreement system can shed light on this complexity, and a comparative analysis eliminates the multiple alignments in the connective system, thus revealing a fairly standard set of determiners.

APA, Harvard, Vancouver, ISO, and other styles

15

Kurt, Gödel, ed. The P=NP question and Gödel's lost letter. New York: Springer, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

16

The Golden Ticket. Princeton University Press, 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!