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
1379
search results - page 15 / 276
»
The Complexity of the Annihilating Polynomial
Sort
relevance
views
votes
recent
update
View
thumb
title
131
click to vote
CORR
2007
Springer
128
views
Education
»
more
CORR 2007
»
On the Complexity of the Interlace Polynomial
15 years 7 months ago
Download
drops.dagstuhl.de
Markus Bläser, Christian Hoffmann
claim paper
Read More »
141
click to vote
ECCC
2007
89
views
more
ECCC 2007
»
The black-box query complexity of polynomial summation
15 years 7 months ago
Download
www.cs.technion.ac.il
Ali Juma, Valentine Kabanets, Charles Rackoff, Ami...
claim paper
Read More »
336
click to vote
NETWORKS
2008
316
views
Computer Networks
»
more
NETWORKS 2008
»
The computational complexity of graph contractions I: Polynomially solvable and NP-complete cases
15 years 7 months ago
Download
pluto.mscc.huji.ac.il
Asaf Levin, Daniël Paulusma, Gerhard J. Woegi...
claim paper
Read More »
332
click to vote
NETWORKS
2008
261
views
Computer Networks
»
more
NETWORKS 2008
»
The computational complexity of graph contractions II: Two tough polynomially solvable cases
15 years 7 months ago
Download
www.win.tue.nl
Asaf Levin, Daniël Paulusma, Gerhard J. Woegi...
claim paper
Read More »
172
click to vote
VLSISP
2010
127
views
more
VLSISP 2010
»
An Efficient Method for Evaluating Complex Polynomials
15 years 2 months ago
Download
hal-ens-lyon.archives-ouvertes.fr
Milos D. Ercegovac, Jean-Michel Muller
claim paper
Read More »
« Prev
« First
page 15 / 276
Last »
Next »
