Machines Over the Reals and Non-Uniformity (Q4336697): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/malq.19970430202 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2054738961 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing over the reals with addition and order: Higher complexity classes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Bounds for the computational power and learning complexity of analog neural nets / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the complexity of integer programming / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:34, 27 May 2024
scientific article; zbMATH DE number 1009464
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Machines Over the Reals and Non-Uniformity |
scientific article; zbMATH DE number 1009464 |
Statements
Machines Over the Reals and Non-Uniformity (English)
0 references
14 May 1997
0 references
polynomial time computability
0 references
polynomial time hierarchy
0 references
polynomial advice
0 references
non-uniform complexity
0 references
real computability
0 references
real complexity class
0 references
survey
0 references
power of real machines over binary inputs
0 references
decision problems over a finite alphabet
0 references
complexity theory
0 references
