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
1383
search results - page 18 / 277
»
On the Complexity of the Interlace Polynomial
Sort
relevance
views
votes
recent
update
View
thumb
title
52
click to vote
ECCC
2007
89
views
more
ECCC 2007
»
The black-box query complexity of polynomial summation
14 years 10 months ago
Download
www.cs.technion.ac.il
Ali Juma, Valentine Kabanets, Charles Rackoff, Ami...
claim paper
Read More »
152
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
14 years 10 months ago
Download
pluto.mscc.huji.ac.il
Asaf Levin, Daniël Paulusma, Gerhard J. Woegi...
claim paper
Read More »
141
click to vote
NETWORKS
2008
261
views
Computer Networks
»
more
NETWORKS 2008
»
The computational complexity of graph contractions II: Two tough polynomially solvable cases
14 years 10 months ago
Download
www.win.tue.nl
Asaf Levin, Daniël Paulusma, Gerhard J. Woegi...
claim paper
Read More »
64
click to vote
VLSISP
2010
127
views
more
VLSISP 2010
»
An Efficient Method for Evaluating Complex Polynomials
14 years 4 months ago
Download
hal-ens-lyon.archives-ouvertes.fr
Milos D. Ercegovac, Jean-Michel Muller
claim paper
Read More »
90
click to vote
MST
2010
105
views
more
MST 2010
»
On the Automatizability of Polynomial Calculus
14 years 8 months ago
Download
www.dsi.uniroma1.it
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...
Nicola Galesi, Massimo Lauria
claim paper
Read More »
« Prev
« First
page 18 / 277
Last »
Next »