Search Sciweavers | Sciweavers

13621 search results - page 101 / 2725

» Computability and Complexity in Self-assembly

142

click to vote

ITNG
2007
IEEE

104views Information Technology» more ITNG 2007»

Computational Power of the Quantum Turing Automata

16 years 11 days 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 »

121

click to vote

COCO
2009
Springer

124views Algorithms» more COCO 2009»

The Complexity of the Annihilating Polynomial

16 years 20 days ago

Download www.math.ias.edu

Neeraj Kayal

claim paper

Read More »

119

click to vote

LICS
2008
IEEE

103views Automated Reasoning» more LICS 2008»

On the Expressiveness and Complexity of Randomization in Finite State Monitors

16 years 14 days ago

Download www.cs.uiuc.edu

Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan

claim paper

Read More »

129

click to vote

CIE
2007
Springer

108views Applied Computing» more CIE 2007»

The Complexity of Small Universal Turing Machines

16 years 8 days ago

Download www.bcri.ucc.ie

Damien Woods, Turlough Neary

claim paper

Read More »

114

click to vote

ICALP
2007
Springer

98views Programming Languages» more ICALP 2007»

Complexity of the Cover Polynomial

16 years 7 days ago

Sciweavers

Explore & Download

Productivity Tools

Sciweavers