Sciweavers

1220 search results - page 5 / 244
» Restricting grammatical complexity
Sort
View
STOC
1996
ACM
97views Algorithms» more  STOC 1996»
15 years 7 months ago
Deterministic Restrictions in Circuit Complexity
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
Shiva Chaudhuri, Jaikumar Radhakrishnan
107
Voted
ENC
2006
IEEE
15 years 9 months ago
Complexity of the Mixed Postman Problem with Restrictions on the Edges
Francisco Javier Zaragoza Martínez