787 search results - page 37 / 158 » Polynomial Constants are Decidable |
ENDM
2010
13 years 8 months ago
2010
Deciding whether an arbitrary graph admits a VLSI layout with unit-length edges is NP-complete [1], even when restricted to binary trees [7]. However, for certain graphs, the prob...
LOGCOM
2010
13 years 6 months ago
2010
Public announcement logic extends multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. In thi...
COCO
2006
Springer
13 years 11 months ago
2006
Springer
We consider the relationship between the complexities of - and those of restricted to formulas of constant density. Let be the infimum of those such that - on variables can be dec...
FSTTCS
2007
Springer
14 years 2 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...