Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
13621
search results - page 101 / 2725
»
Computability and Complexity in Self-assembly
Sort
relevance
views
votes
recent
update
View
thumb
title
25
click to vote
ITNG
2007
IEEE
104
views
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 »
27
click to vote
COCO
2009
Springer
124
views
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 »
22
click to vote
LICS
2008
IEEE
103
views
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 »
27
click to vote
CIE
2007
Springer
108
views
Applied Computing
»
more
CIE 2007
»
The Complexity of Small Universal Turing Machines
14 years 4 months ago
Download
www.bcri.ucc.ie
Damien Woods, Turlough Neary
claim paper
Read More »
18
click to vote
ICALP
2007
Springer
98
views
Programming Languages
»
more
ICALP 2007
»
Complexity of the Cover Polynomial
14 years 4 months ago
Download
www-cc.cs.uni-saarland.de
Markus Bläser, Holger Dell
claim paper
Read More »
« Prev
« First
page 101 / 2725
Last »
Next »