1795 search results - page 53 / 359 » On the Complexity of Circuit Satisfiability |
ISORC
2008
IEEE
14 years 3 months ago
2008
IEEE
The specific constraints that must be satisfied by embedded systems, such as timeliness, energy efficiency of battery-operated devices, dependable operation in safety-relevant sce...
TCOM
2010
13 years 7 months ago
2010
—Training sequences for data-aided timing estimation in multi-input multi-output systems are designed. It is observed that for low complexity implementation, the sequences must n...
ECCC
2008
13 years 8 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
COMPGEOM
1996
ACM
14 years 26 days ago
1996
ACM
We show that any simply connected (but not necessarily convex) polyhedron with an even number of quadrilateral sides can be partitioned into O(n) topological cubes, meeting face t...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...