P, NP, and NP-completeness : the basics of computational complexity /

P, NP, and NP-completeness : the basics of computational complexity /

Includes bibliographical references and index

Bibliographic Details
Main Author:	457465 Goldreich, Oded
Format:
Language:	eng
Published:	New York : Cambridge University Press, c201
Subjects:	Approximation theory Polynomials Computational complexity Computer algorithms

Similar Items

An overview on polynomial approximation of NP-hard problems
by: Paschos Vangelis Th.
Published: (2009-01-01)

Computational complexity : a conceptual perspective /
by: 457465 Goldreich, Oded
Published: (2008)

Computer and intractability : a guide to the theory of NP-completeness /
by: 403671 Garey, Michael R., et al.
Published: (1979)

Towards the Solution of NP Complete Problems
by: Amit Kumar, et al.
Published: (2010-01-01)

Approximation algorithms for NP-hard problems /
by: Hochbaum, Dorit (Dorit S.)
Published: (1997)

Universal First-Order Logic is Superfluous for NL, P, NP and coNP
by: Nerio Borges, et al.
Published: (2014-03-01)

Ising formulations of many NP problems
by: Andrew eLucas
Published: (2014-02-01)

Computing quantum discord is NP-complete
by: Yichen Huang
Published: (2014-01-01)

Algorithms from P to NP /
by: 354268 Moret, Bernard M. E., et al.
Published: (1991)

Foundations of cryptography : volume 1 basic tools /
by: 457465 Goldreich, Oded
Published: (2001)

Proof Compression and NP Versus PSPACE II: Addendum
by: Lew Gordeev, et al.
Published: (2022-01-01)

Minimization of visibly pushdown automata is NP-complete
by: Olivier Gauwin, et al.
Published: (2020-02-01)

DNA Computing and Its Application on NP Completeness Problem
by: Hasudungan, Rofilde, et al.
Published: (2013)

Physical manifestation of NP-completeness in analog computer devices
by: Lee, Frank, 1975-
Published: (2013)

Proof Compression and NP Versus PSPACE II
by: Lew Gordeev, et al.
Published: (2020-11-01)

Information, uncertainty, complexity /
by: Traub, J. F. (Joseph Frederick), 1932-, et al.
Published: (1983)

Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing
by: Oded Goldreich, et al.
Published: (2022-12-01)

NP-hard but no longer hard to solve? Using quantum computing to tackle optimization problems
by: Rhonda Au-Yeung, et al.
Published: (2023-02-01)

NP-Completeness Results for Minimum Planar Spanners
by: Ulrik Brandes, et al.
Published: (1998-01-01)

Constrained approximation of a compact set in a normed spa /
by: 185895 Kim-Pin, Lim
Published: ([198)

Approximation by polynomials with integral coefficients /
by: 351632 Ferguson Le Baron O.
Published: (1980)

As good as it gets: a scaling comparison of DNA computing, network biocomputing, and electronic computing approaches to an NP-complete problem
by: Ayyappasamy Sudalaiyadum Perumal, et al.
Published: (2021-01-01)

Tatamibari is NP-complete
by: Adler, Aviv, et al.
Published: (2021)

Research of NP-Complete Problems in the Class of Prefractal Graphs
by: Rasul Kochkarov
Published: (2021-10-01)

Computational Complexity
by: J. A. Tenreiro Machado, et al.
Published: (2017-02-01)

Requirements Content Goodness and Complexity Measurement Based On NP Chunks
by: Chao Y. Din
Published: (2009-06-01)

On basing private information retrieval on NP-hardness
by: Liu, Tianren, Ph. D. Massachusetts Institute of Technology
Published: (2016)

Mean Lifetimes of ns, np, nd, & nf Levels of N V
by: Rizwana Siddique, et al.
Published: (2023-09-01)

On NP-hardness of the clique partition : independence number gap recognition and related problems
by: Busygin, Stanislav., et al.
Published: (2012)

Below P vs NP : fine-grained hardness for big data problems
by: Backurs, Arturs
Published: (2019)

Approximation of functions by polynomials and splines /
by: Stechkin, S. B.
Published: (1981)

Polunomial and spline approximation : theory and applications /
by: Nato Advanced Study Institute in Polynomial and Spline Approximation, University of Calgary, 1978, et al.
Published: (1978)

GPSG-Recognition is NP-Hard
by: Ristad, Eric Sven
Published: (2004)

ON THE COMPLEX NP IN PORTUGUESE
by: Marco A. Oliveira
Published: (2012-12-01)

A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
by: Andreas Emil Feldmann, et al.
Published: (2020-06-01)

Approximation of Functions in Lp, Î± (I) (0 < p < 1)
by: Saheb K. Jassim, et al.
Published: (2017-04-01)

Testing Distributions of Huge Objects
by: Oded Goldreich, et al.
Published: (2023-12-01)

NP-Hardness of the Problem of Optimal Box Positioning
by: Alexei V. Galatenko, et al.
Published: (2019-08-01)

On growth of polynomials
by: Govil NK
Published: (2002-01-01)

A Modified Heuristic Procedure for NP-Complete Problems Supported by Genetic Algorithms
by: Najla Al-Saati
Published: (2004-05-01)