The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.

## Filters

##
###
Page 3950 of Mathematical Reviews Vol. , Issue 92g
[page]

1992
*
Mathematical Reviews
*

It is shown that

*the*time*complexity**for**the**problems**of*equiva- lence*of*formulas and equivalence*of*straight-line programs*on*a class*of*commutative rings are co-*NP**hard*and “SAT*hard*”. ... Summary: “As communications protocols are becoming more and more*complex*, efficient algorithms are needed*for**the**problem**of**generating*minimum-length*test*sequences. ...##
###
The Complexity of Design Automation Problems
[chapter]

1988
*
Handbook of Advanced Semiconductor Technology and Computer Systems
*

Emphasis is

doi:10.1007/978-94-011-7056-7_17
fatcat:muwhoo6fgvfdlmszv4wheza53q
*on**problems*involving*the*physical implementation and*testing*stages*of**the*design process. Section 2 contains a brief description, in*general*terms,*of**the*DA*problems*considered. ... This paper reviews several*problems*that arise in*the*area*of*design automation. Most*of*these*problems*are shown to be*NP*-*hard*. ...*For*most*NP*-*hard**problems*, it is*the**case*that*the**problem**of*finding absolute approximations is also*NP*-*hard*. ...##
###
The complexity of design automation problems

1980
*
Proceedings of the seventeenth design automation conference on Design automation - DAC '80
*

Emphasis is

doi:10.1145/800139.804562
dblp:conf/dac/SahniB80
fatcat:h427snpf35gjdhub6ugvxkfpza
*on**problems*involving*the*physical implementation and*testing*stages*of**the*design process. Section 2 contains a brief description, in*general*terms,*of**the*DA*problems*considered. ... This paper reviews several*problems*that arise in*the*area*of*design automation. Most*of*these*problems*are shown to be*NP*-*hard*. ...*For*most*NP*-*hard**problems*, it is*the**case*that*the**problem**of*finding absolute approximations is also*NP*-*hard*. ...##
###
Challenges to complexity shields that are supposed to protect elections against manipulation and control: a survey

2013
*
Annals of Mathematics and Artificial Intelligence
*

attempts, despite

doi:10.1007/s10472-013-9359-5
fatcat:4ur4dxghhnblbn2iqumu3ss2sm
*the**NP*-*hardness**of**the*corresponding*problems*. ... However, most*of*this work has yielded*NP*-*hardness*results, showing that certain voting systems resist certain types*of*manipulation or control only in*the*worst*case*. ...*The*results also show that more*of**the**tested*elections are controllable by deleting voters than by adding voters, and*the*same can be observed regarding candidate control. ...##
###
Page 6179 of Mathematical Reviews Vol. , Issue 91K
[page]

1991
*
Mathematical Reviews
*

computing
91k:68067
91k:68064 68Q15 68Q25
Sanchis, Laura A. (1-COLG)

*On**the**complexity**of**test**case**generation**for**NP*-*hard**problems*. ...*The*author shows that, unless*NP*= co-*NP*,*for*most*NP*-*hard*prob- lems there cannot exist an efficient*test*-*case*construction method capable*of**generating*all instances*of**the**problem*, with known answers ...##
###
The computational complexity of probabilistic inference using bayesian belief networks

1990
*
Artificial Intelligence
*

This result suggests that research should be directed away from

doi:10.1016/0004-3702(90)90060-d
fatcat:gkme3lmkxja5zcojghutnq4bre
*the*search*for*a*general*, efficient probabilistic inference algorithm, and toward*the*design*of*efficient special-*case*, average-*case*, and ... More*general*classes*of*belief networks, however, have eluded efforts to develop efficient inference algorithms. We show that probabilistic inference using belief networks is*NP*-*hard*. ... ACKNOWLEDGEMENT I thank Marty Chavez, Lyn Dupre, David Heckerman, Eddie Herskovits, Eric Horvitz, Richard Lin, Judea Pearl, and Mike Wellman*for*valuable comments*on*earlier versions*of*this paper. ...##
###
Hybridization of the optimization process as an alternative way to find approximate solutions for NP-hard problems

2015
*
Przeglad Elektrotechniczny
*

This paper presents

doi:10.15199/48.2015.02.15
fatcat:amhtrwwu4bcw7mpk7nl74qy2de
*the*results*of*calculations that demonstrate*the*possibility*of*using hybrid optimization method (with variable structure)*for*determining*the*approximate solutions to*NP*-*hard**problems*...*The*Travelling Salesman*Problem*(TSP) is a classic combinatorial optimization subject, which has found widespread use in practice. Simple in definition, have remained*hard*to solve*for*many years. ...*One*can convert any*NP*-complete*problem*to*NP*-*hard**one*under a polynomial time Search*for*a Minimum size*of*Reduct. ...##
###
How hard are n2-hard problems?

1994
*
ACM SIGACT News
*

Many

doi:10.1145/181462.181465
fatcat:in2eefzlvrcxxe32diyiecnahu
*of**the*\n 2 -*hard*"*problems*described by Gajentaan and Overmars can be solved using limited nondeterminism or other sharply-bounded quanti ers. ... Thus we suggest that these*problems*are not among*the*hardest*problems*solvable in quadratic time. ... We discuss here a m o r e p r e c i s e bound*on**the**complexity*o f these*problems*. Gajentaan and Overmars 4] de ne a*problem*to be n 2 -*hard*if*the*following base*problem*can bereduced to it. ...##
###
Computational complexity of real structured singular value in l/sub p/ setting

2000
*
IEEE Transactions on Automatic Control
*

*The*first

*one*shows that this

*generalized*

*problem*is

*NP*-

*hard*

*for*any given rational number [1 ] .

*The*

*NP*-

*hardness*holds as long as ,

*the*size

*of*

*the*largest repeated block, exceeds

*one*. ...

*One*might hope that

*the*techniques used in [2] , [3] , [11] , and [12]

*for*showing

*the*

*NP*-

*hardness*

*of*

*the*1

*problem*is generalizable to

*the*p

*case*. Unfortunately, this is not

*the*

*case*. ...

##
###
On the complexity of graph tree partition problems

2004
*
Discrete Applied Mathematics
*

We achieve a complete characterization

doi:10.1016/s0166-218x(03)00340-8
fatcat:45rtgu27wrh5vjdewzmdb46xee
*of*its computational*complexity*, previously studied only*for*special*cases*: a polynomial algorithm based*on*a new matroid solves*the*easy*cases*;*the*others are strongly ...*NP*-*hard*by direct reduction from SAT. ... b In P*for*|Rr| = 1 (a special*case**of**the*Minimum Spanning Forest) [13]. c Simply*NP*-*hard**for*|Rr| = 1 [16]. d Strongly*NP*-*hard**for*wv = 1 and W − = W + = W=p [9,10]. ...##
###
On Generalized Optimal Hard Decision Fusion
[article]

2017
*
arXiv
*
pre-print

In this letter, we formulate a

arXiv:1707.08206v1
fatcat:l6mhuemm25amxola75p3dpxkei
*generalized*decision fusion*problem*(GDFP)*for*sensing with centralized*hard*decision fusion. ... We show that various new and existing decision fusion rules are special*cases**of**the*proposed GDFP. We then relate our*problem*to*the*classical 0-1 Knapsack*problem*(KP). ... It is shown in [6] , [7] that*the**problem**of*optimal*hard*decision fusion in a*general**NP*setting is exponentially*complex*. ...##
###
The 0–1 inverse maximum stable set problem

2008
*
Discrete Applied Mathematics
*

Finally, we compare

doi:10.1016/j.dam.2008.03.015
fatcat:iflyp6bakndypbiyro6g77vc4m
*the**hardness**of*IS {0,1} and IS {0,1},2opt*for*some other classes*of*graphs. ... Firstly, we show that they are*NP*-*hard*, even if*the*fixed stable set contains only*one*vertex. Secondly, we achieve an approximation ratio {0,1},2opt . ... We then consider*the*instance ( 3 G , S )*of**the*optimality*test*associated with*the*maximum stable set*problem*. This construction can be performed in polynomial time. ...##
###
Robust network optimization under polyhedral demand uncertainty is NP-hard

2010
*
Discrete Applied Mathematics
*

Though some evidence

doi:10.1016/j.dam.2009.09.025
fatcat:qhta5zibj5hpjagz53vaiwhnfu
*of**the*computational difficulty*of*such*problems*can be found in*the*literature, no formal*NP*-*hardness*proof was available up to now. ... In*the*present paper, this pending*complexity*issue is settled*for*all robust network optimization*problems*featuring polyhedral demand uncertainty, both*for**the*single-commodity and multicommodity*case*... We have investigated here various*complexity*issues related to such*problems*, including a direct proof*of**NP*-*hardness*, not only*for**the**general**case*, but also*for*some fairly restricted*cases*(such as ...##
###
New algorithms for coupled tasks scheduling – a survey

2012
*
Reserche operationelle
*

Unfortunately, most

doi:10.1051/ro/2012020
fatcat:zgt3wulwnfcfrdhdaoifz2t2ce
*of**the*coupled tasks*problems*are*NP*-*hard*, and only a few practically usable algorithms*for*such*problems*were found. ...*problem*, and a fast heuristic algorithm*for*more*general*1|(1, 2k, 1), strict chains|Cmax*problem*, where k ∈ N. ... Sect. 2*for**problem*notation).*The*strong*NP*-completeness*of**the**case*, where*the*precedence constraints graph is a*general*graph, was shown in [8] . ...##
###
On Nonadaptive Security Reductions of Hitting Set Generators

2020
*
International Workshop on Approximation Algorithms for Combinatorial Optimization
*

*One*

*of*

*the*central open questions in

*the*theory

*of*average-

*case*

*complexity*is to establish

*the*equivalence between

*the*worst-

*case*and average-

*case*

*complexity*

*of*

*the*Polynomial-time Hierarchy (PH). ...

*One*

*general*approach is to show that there exists a PH-computable hitting set

*generator*whose security is based

*on*some

*NP*-

*hard*

*problem*. ... This in particular shows that

*the*average-

*case*

*hardness*

*of*

*NP*cannot be based

*on*

*the*worst-

*case*

*hardness*

*of*an

*NP*-complete

*problem*using such a reduction technique (unless

*the*polynomial-time hierarchy ...

« Previous

*Showing results 1 — 15 out of 113,412 results*