Skip to search formSkip to main contentSkip to account menu

Computers and Intractability: A Guide to the Theory of NP-Completeness

In computer science, more specifically computational complexity theory, Computers and Intractability: A Guide to the Theory of NP-Completeness is an… 
Wikipedia (opens in a new tab)

Related topics

Related topics

15 relations
AKS primality testChordal completionComputational complexity theoryComputer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Structural sparseness and complex networks
The field of complex networks has seen a steady growth in the last decade, fuelled by an ever-growing collection of relational… 
2013
2013
GROWTH OF THE IDEAL GENERATED BY A QUADRATIC MULTIVARIATE FUNCTION OVER GF(3)
Let K be the field GF(3). We calculate the growth of the ideal Aλ where A is the algebra of functions from Kn → Kn and λ is a… 
2008
2008
Functions and Polynomials over Finite Groups from the Computational Perspective
In the thesis we investigate the connections between arbitrary functions and their realizing polynomials over nite algebras. We… 
2007
2007
Multi-tier programming
  • 2007
  • Corpus ID: 44493249
Multi-tier applications are traditionally designed in the style of a client-server architecture, forcing different parts of the… 
2007
2007
El problema del árbol de empuje en sistemas de telecomunicaciones
En los sistemas de distribucion de informacion en sistemas de telecomunicaciones se utiliza una combinacion de "empujar" y "jalar… 
2005
2005
SAT-Based Cooperative Planning: A Proposal
We present a work-in-progress on distributed planning, which relies on the “planning as satisfiability” paradigm. It allows for… 
1996
1996
Formal Methods in VLSI System Design
We apply mathematical logic to a number of problems arising in very large scale integration (VLSI) design automation. The rst… 
1995
1995
Technology mapping of lookup table based field programmable gate arrays
The Field Programmable Gate Array (FPGA) is a very attractive technology for application specific integrated circuit designs due… 
1993
1993
Database and display algorithms for interactive visualization of architectural models
This thesis describes a system for interactive walkthroughs of large, fully furnished architectural models. Realistic-looking… 
1990
1990
A Nontrivial Lower Bound for an NP Problem on Automata
  • E. Grandjean
  • SIAM journal on computing (Print)
  • 1990
  • Corpus ID: 31205592
An NP problem L is linearly NP-complete if each ${\operatorname{NTIME}}(n)$-problem is reducible to L in linear time on a… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)