13603 search results - page 152 / 2721 » On the Complexity of Computing Treelength |
115
click to vote
ITNG
2007
IEEE
15 years 10 months ago
2007
IEEE
Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
COCO
2009
Springer
15 years 10 months ago
2009
Springer
LICS
2008
IEEE
15 years 10 months ago
2008
IEEE
ICALP
2007
Springer
15 years 10 months ago
2007
Springer