Search Sciweavers | Sciweavers

13603 search results - page 152 / 2721

» On the Complexity of Computing Treelength

click to vote

ITNG
2007
IEEE

104views Information Technology» more ITNG 2007»

Computational Power of the Quantum Turing Automata

14 years 4 months ago

Download sharif.edu

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...

Sina Jafarpour, Mohammad Ghodsi, Keyvan Sadri, Zuh...

claim paper

Read More »

click to vote

COCO
2009
Springer

124views Algorithms» more COCO 2009»

The Complexity of the Annihilating Polynomial

14 years 4 months ago

Download www.math.ias.edu

Neeraj Kayal

claim paper

Read More »

click to vote

LICS
2008
IEEE

103views Automated Reasoning» more LICS 2008»

On the Expressiveness and Complexity of Randomization in Finite State Monitors

14 years 4 months ago

Download www.cs.uiuc.edu

Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan

claim paper

Read More »

click to vote

CIE
2007
Springer

108views Applied Computing» more CIE 2007»

The Complexity of Small Universal Turing Machines

14 years 3 months ago

Download www.bcri.ucc.ie

Damien Woods, Turlough Neary

claim paper

Read More »

click to vote

ICALP
2007
Springer

98views Programming Languages» more ICALP 2007»

Complexity of the Cover Polynomial

14 years 3 months ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers