Empirical analysis and optimization of an NP−hard problem using CSP and FDR

Empirical analysis and optimization of an NP−hard problem using CSP and FDR

Bibliographic Details
Main Authors:	Creager, D, Simpson, A
Format:	Conference item
Published:	2007

Similar Items

Verifying Statemate Statecharts Using CSP and FDR
by: Roscoe, A, et al.
Published: (2006)

Counter Abstraction in the CSP/FDR setting
by: Mazur, T, et al.
Published: (2007)

Counter abstraction in the CSP/FDR setting
by: Mazur, T, et al.
Published: (2009)

Critical systems validation and verification with CSP and FDR
by: Goldsmith, M, et al.
Published: (1999)

Compiling Statemate Statecharts into CSP and verifying them using FDR
by: Roscoe, A
Published: (2003)

Modelling and verifying key−exchange protocols using CSP and FDR
by: Roscoe, A
Published: (1995)

FDR3 — A Modern Refinement Checker for CSP
by: Gibson−Robinson, T, et al.
Published: (2014)

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

Heuristics for NP-hard optimization problems - simpler is better!?
by: Žerovnik Janez
Published: (2015-11-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)

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

The cellular selection mechanism for multi solution NP-hard optimization problems /
by: Hossein Rajabalipour Cheshmehgaz, 1975-, author, et al.
Published: (2009)

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

FDR into The Cloud
by: Gibson−Robinson, T, et al.
Published: (2014)

Learning optimal quantum models is NP-hard
by: Stark, Cyril
Published: (2018)

Cellular Neural Networks for NP-Hard Optimization
by: M&#225;ria Ercsey-Ravasz, et al.
Published: (2009-02-01)

Parallelization of FDR
by: Goldsmith, M, et al.
Published: (2002)

Many bounded versions of undecidable problems are NP-hard
by: Andreas Klingler, Mirte van der Eyden, Sebastian Stengele, Tobias Reinhart, Gemma de las Cuevas
Published: (2023-06-01)

NP-hardness of some linear control design problems
Published: (2003)

Rigid foldability is NP-hard
by: Demaine, Erik D, et al.
Published: (2020)

NP-hardness of deciding convexity of quartic polynomials and related problems
by: Ahmadi, Amir Ali, et al.
Published: (2012)

Recent developments in FDR
by: Armstrong, P, et al.
Published: (2012)

Recent Developments in FDR
by: Armstrong, P, et al.
Published: (2012)

Recent developments in FDR
by: Armstrong, P, et al.
Published: (2012)

Recent developments in FDR
by: Armstrong, P, et al.
Published: (2012)

NP-hardness of minimum circuit size problem for OR-AND-MOD circuits
by: Hirahara, S, et al.
Published: (2018)

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

Filtering, FDR and power
by: van Iterson Maarten, et al.
Published: (2010-09-01)

FDR2 user manual
by: Gardiner, P, et al.
Published: (2000)

On NP−hardness of the clique partition – Independence number gap recognition and related problems
by: Busygin, S, et al.
Published: (2006)

Identification and signatures based on NP-hard problems of indefinite quadratic forms
by: Hartung Rupert J., et al.
Published: (2008-12-01)

Probabilistic solving of NP-hard problems with bistable nonlinear optical networks
by: Kyriienko, O., et al.
Published: (2019)

Parallel Platform For New Secure Stream Ciphers Based On Np-hard Problems
by: Mohammad A. Suwais, Khaled
Published: (2009)

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

Evolutionary Hybrid Particle Swarm Optimization Algorithm for Solving NP-Hard No-Wait Flow Shop Scheduling Problems
by: Laxmi A. Bewoor, et al.
Published: (2017-10-01)

Fedor Danilovich Ryzhenko – our FDR
by: A. A. Аhtamzian, et al.
Published: (2012-10-01)

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

Almost complete solution for the NP-hard separability problem of Bell diagonal qutrits
by: Christopher Popp, et al.
Published: (2022-07-01)

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

On Basing One-way Permutations on NP-hard Problems under Quantum Reductions
by: Nai-Hui Chia, et al.
Published: (2020-08-01)