
ringLWE
 Referenced in 23 articles
[sw19028]
 loss in their underlying worstcase hardness guarantees, and very little loss in computational efficiency...

FHEW
 Referenced in 20 articles
[sw14880]
 scheme (based on the worstcase hardness of standard lattice problems) and report...

SWIFFT
 Referenced in 46 articles
[sw11588]
 hard as finding short vectors in cyclic/ideal lattices in the worst case...

trlib
 Referenced in 3 articles
[sw17722]
 discretization of function space problems. The hard case of the trust region problem frequently arises ... effort to fully address the hard case in an exact way by considering all invariant...

SQPlab
 Referenced in 161 articles
[sw05161]
 solve however; in particular it is NPhard when the quadratic objective is nonconvex ... derivatives, is time consuming. Indeed, in this case, the time spent in finding the solution...

SLIDE
 Referenced in 9 articles
[sw08449]
 variables. We show that SLIDE, a special case of CardPath where the slid constraint must ... Since propagation is NPhard in general, we identify special cases where propagation takes polynomial...

Eraser
 Referenced in 44 articles
[sw08922]
 data race, yet it can be extremely hard to locate this mistake during debugging. This ... locking behavior is observed. We present several case studies, including undergraduate coursework and a multithreaded...

MiniMaxSat
 Referenced in 34 articles
[sw09732]
 main features are: learning and backjumping on hard clauses; resolutionbased and subtractionbased lower ... best specialized alternative and, in some cases, even better...

MPTP 0.2
 Referenced in 45 articles
[sw02589]
 both on the easy and on the hard MML problems, sometimes assisted by machine learning ... deconstruction’ done by MPTP is in this case already complete. About every fifth nonarithmetical theorem...

pwcet
 Referenced in 8 articles
[sw14479]
 real worst case execution time. We introduce the notion of probabilistic hard realtime system ... execution time of the worst case path of sections of code. The technique behind pWCET...

RIATAHGT
 Referenced in 5 articles
[sw17371]
 very hard (NPhard). Efficient algorithms exist for solving restricted cases of the problem...

ODEA
 Referenced in 3 articles
[sw07671]
 known to be NPhard even in very restricted cases. Literature reports about special cases...

MUP
 Referenced in 15 articles
[sw11910]
 manipulation. This algorithm has a worsecase complexity that is exponential only in the treewidth ... highlighting its efficiency on a set of hard problems as well as its ability...

SymPLFIED
 Referenced in 2 articles
[sw20832]
 used to uncover hardtodetect catastrophic cases caused by transient errors in programs that...

BLOOMP
 Referenced in 25 articles
[sw06454]
 matching pursuit (OMP), subspace pursuit (SP), iterative hard thresholding (IHT), basis pursuit (BP), and Lasso ... have the best performance. In the noiseless case, BPBLOT has the highest resolving power ... Detailed comparisons with the algorithms spectral iterative hard thresholding and the frameadapted BP demonstrate...

DeCIF
 Referenced in 2 articles
[sw01572]
 mathematical treatment hardly practicable, and it would in any case make the formal presentation...

MultiRace
 Referenced in 2 articles
[sw21726]
 race detection problem is computationally hard in the general case. Thus, all currently available tools...

EvAg
 Referenced in 3 articles
[sw29523]
 more outstanding as problem hardness and size increase. In some cases the new algorithm reduces...

TENSOLVE
 Referenced in 28 articles
[sw00956]
 equations and unknowns, in cases where it is reasonable to calculate the Jacobian matrix ... chosen so that the model is hardly more expensive to form, store, or solve than...

IF2.0
 Referenced in 46 articles
[sw03303]
 automated validation of complex systems can hardly be achieved without tool integration. The development ... toolbox was successfully used on several case studies. par In spite of the interest...