Results 101 to 110 of about 460,881 (203)
The Straight-Line RAC Drawing Problem is NP-Hard
Journal of Graph Algorithms and Applications, 2012 A RAC drawing of a graph is a polyline drawing in which every pair of crossing edges intersects at right angle. In this paper, we focus on straight-line RAC drawings and demonstrate an infinite class of graphs with unique RAC combinatorial embedding.
Evmorfia Argyriou +2 more
doaj +1 more source
Complexity of Planar Graph Orientation Consistency, Promise-Inference, and Uniqueness, with Applications to Minesweeper Variants [PDF]
We study three problems related to the computational complexity of the popular game Minesweeper. The first is consistency: given a set of clues, is there any arrangement of mines that satisfies it? This problem has been known to be NP-complete since 2000
MIT Hardness Group +2 more
core +1 more source
Planar Embeddings of Graphs with Specified Edge Lengths
Journal of Graph Algorithms and Applications, 2007 We consider the problem of finding a planar straight-line embedding of a graph with a prescribed Euclidean length on every edge. There has been substantial previous work on the problem without the planarity restrictions, which has close connections to ...
Sergio Cabello +2 more
doaj +1 more source
On the (Non) NP-Hardness of Computing Circuit Complexity [PDF]
, 2015 The Minimum Circuit Size Problem (MCSP) is: given the truth table of a Boolean function f and a size parameter k, is the circuit complexity of f at most k?
Williams, R. Ryan, Murray, Cody D.
core +1 more source
NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach [PDF]
It is a long-standing open problem whether the Minimum Circuit Size Problem ($\mathrm{MCSP}$) and related meta-complexity problems are NP-complete. Even for the rare cases where the NP-hardness of meta-complexity problems are known, we only know very ...
Hanlin Ren, Yizhi Huang, Rahul Ilango
core +1 more source
AlgorithmsToday, facility location planning primarily pertains to the long-term strategic and operational decision-making of large public and private organizations, and the significant costs associated with facility location, construction, and operation have ...
Salar Babaei +3 more
doaj +1 more source
Haskell-style overloading is NP-hard [PDF]
Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94), 2002 Extensions of the ML type system, based on constrained type schemes, have been proposed for languages with overloading. Type inference in these systems requires solving the following satisfiability problem. Given a set of type assumptions C over finite types and a type basis A, is there is a substitution S that satisfies C in that A implies that CS is ...
openaire +3 more sources
Easier Ways to Prove Counting Hard: A Dichotomy for Generalized #SAT, Applied to Constraint Graphs [PDF]
To prove #P-hardness, a single-call reduction from #2SAT needs a clause gadget to have exactly the same number of solutions for all satisfying assignments - no matter how many and which literals satisfy the clause. In this paper, we relax this condition,
Hecher, Markus +7 more
core +1 more source
Complexity issues for the symmetric interval eigenvalue problem
Open Mathematics, 2014 We study the problem of computing the maximal and minimal possible eigenvalues of a symmetric matrix when the matrix entries vary within compact intervals. In particular, we focus on computational complexity of determining these extremal eigenvalues with
Hladík Milan
doaj +1 more source