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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
13603
search results - page 123 / 2721
»
On the Complexity of Computing Treelength
Sort
relevance
views
votes
recent
update
View
thumb
title
85
click to vote
MFCS
1989
Springer
46
views
Theoretical Computer Science
»
more
MFCS 1989
»
Switching Graphs and Their Complexity
15 years 7 months ago
Download
www.win.tue.nl
Christoph Meinel
claim paper
Read More »
109
click to vote
CIE
2010
Springer
151
views
Applied Computing
»
more
CIE 2010
»
Avoiding Simplicity Is Complex
15 years 7 months ago
Download
ftp.cs.rutgers.edu
Eric Allender
claim paper
Read More »
109
click to vote
CSR
2008
Springer
97
views
Theoretical Computer Science
»
more
CSR 2008
»
Combinatorial Complexity of Regular Languages
15 years 5 months ago
Download
lpcs.math.msu.su
Arseny M. Shur
claim paper
Read More »
96
click to vote
CSE
2007
IEEE
87
views
Theoretical Computer Science
»
more
CSE 2007
»
Making the Complex Simple
15 years 4 months ago
Download
www.flickos.com
Julian V. Noble
claim paper
Read More »
141
click to vote
ECCC
2000
158
views
more
ECCC 2000
»
On the Computational Power of Winner-Take-All
15 years 4 months ago
Download
www.igi.tugraz.at
This article initiates a rigorous theoretical analysis of the computational power of circuits that employ modules for computing winner-take-all. Computational models that involve ...
Wolfgang Maass
claim paper
Read More »
« Prev
« First
page 123 / 2721
Last »
Next »